Lógica

Decidability of first-order theories

Por Cristina Sernadas (Instituto Superior Técnico, Universidade de Lisboa).

Abstract: Some results and reduction techniques for proving decidability of mathematical theories and completeness of logics are presented. The crucial role of the theory of real closed ordered fields is explained. Selected illustrations from Euclidean Geometry to Quantum Logic are discussed.

On the undecidibility of type inhabitation for atomic polymorphism (part 2)

Por Clarence Protin (Independent Scholar).

Abstract: Pawel Urzyczyn has shown how to obtain a syntactic proof of the undecidability of type inhabitation for systems $F$ and $F_\omega$ by a reduction involving the codification of a certain undecidable $\forall,\rightarrow$- fragment of intutitionistic predicate calculus and the use of the Curry-Howard isomorphism. We show how this technique can be simplified and used to prove the undecidability of type inhabitation for atomic polymorphism.

On the undecidibility of type inhabitation for atomic polymorphism

Por Clarence Protin (Independent Scholar).

Abstract: Pawel Urzyczyn has shown how to obtain a syntactic proof of the undecidability of type inhabitation for systems $F$ and $F_\omega$ by a reduction involving the codification of a certain undecidable $\forall,\rightarrow$- fragment of intutitionistic predicate calculus and the use of the Curry-Howard isomorphism. We show how this technique can be simplified and used to prove the undecidability of type inhabitation for atomic polymorphism.

Páginas