review of Rasiowa-Sikorski, JSL 17, p. 72. 44 Coquand A quite clear presentation of a topological proof of completeness for ørst-order logic.

 Home/Search   Document Not in Database   Summary   Related Articles  

This paper is cited in the following contexts:
Computational Content of Classical Logic - Coquand (1996)   (5 citations)  (Correct)

....ichanges its mindj and take c = x instead. 2.6 References [Aczel78] P. Aczel iAn introduction to inductive de nitions.j In Hanbook of mathematical logic, J. Barwise ed. North Holland, p. 739 782. Presents the notion of inductive de nitions in a simple and clear way. Buchholz] W. Buchholz, S. Feferman, W. Pohlers and W. Sieg Iterated Inductive De nitions and Subsystems of Analysis. LNM 897. One quite important point is that the negative translation does not work in presence of generalised inductive de nitions. In the next section, we will see that it does not work in presence of the Axiom of ....

.... tensor product B 1 Omega B 2 whose direct algebraic description is subtle (it is not the algebraic product of B 1 and B 2 which corresponds to the sum of X 1 and X 2 ) In the other direction, we can give as example the Baire theorem, which corresponds to a simple lemma known as Tarski s lemma [Feferman] What is striking from a proof theoretic viewpoint is that in nitary notions on one side are replaced by nitary notions on the other side. Often not only the use of the Axiom of Choice, but also of the law of excluded middle disappear on the algebraic side [Stone] Formal topology generalises ....

[Article contains additional citation context not shown here]

review of Rasiowa-Sikorski, JSL 17, p. 72. 44 Coquand A quite clear presentation of a topological proof of completeness for ørst-order logic.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC