MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Formal topologies o the set of first-order formulae [1 citations — 1 self]

Download:
pdf | ps
by Thierry Coquand, Sara Sadocco, Giovanni Sambin, Jan M. Smith
Journal of Symbolic Logic
ftp://ftp.cs.chalmers.se/pub/cs-reports/papers/smith/logiccovers.ps.gz
Add To MetaCart

Abstract:

The completeness proof for first-order logic by Rasiowa and Sikorski [13] is a simplification of Henkin's proof [7] in that it avoids the addition of infinitely many new individual constants. Instead they show that each consistent set of

Citations

248 Vulnerabilities Analysis – Bishop - 1999
211 Programming in Martin-Löf’s Type Theory: An Introduction – Nordström, Petersson, et al. - 1990
43 Intuitionistic formal spaces – a first communication – Sambin - 1987
25 The completeness of the first-order functional calculus,” The – Henkin - 1949
24 Partially ordered sets – MacNeille - 1937
18 Pretopologies and completeness proofs – Sambin - 1995
17 Formal spaces – Fourman, Grayson - 1982
10 A pointfree approach to Constructive Analysis in Type Theory – Cederquist - 1997
10 Open locales and exponentiation – Johnstone - 1984
10 Constructive completeness of intuitionistic predicate logic: A formalisation in type theory – Persson - 1996
9 Building up a toolbox for Martin-Lof's type theory: subset theory. In Twenty- years of constructive type theory – Sambin, Valentini - 1995
7 Minimal models of Heyting arithmetic – Moerdijk, Palmgren - 1997
4 A proof of the completeness theorem of Gödel – Rasiowa, Sikorski - 1950
3 An application of constructive completeness – Coquand, Smith - 1995
3 An explicit boolean-valued model for non-standard arithmetic – Dragalin - 1993
1 Review of "A proof of the completeness theorem of Godel" by – Feferman - 1952
1 Topologie formali sull'insieme delle formule. Tesi di laurea – Sadocco - 1996
View or Download | Add to My Collection | Correct Errors