Logic Colloquium '90: ASL Summer Meeting in HelsinkiJuha Oikkonen, Jouko Väänänen Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. This volume, the second publication in the Lecture Notes in Logic series, is the proceedings of the Association for Symbolic Logic meeting held in Helsinki, Finland, in July 1990. It contains eighteen papers by leading researchers, covering all fields of mathematical logic from the philosophy of mathematics, through model theory, proof theory, recursion theory, and set theory, to the connections of logic to computer science. The articles published here are still widely cited and continue to provide ideas for ongoing research projects. |
Contents
1 | |
On the geometry of Urank 2 types | 10 |
Definability and global degree theory | 25 |
About the irreflexivity hypothesis for free left distributive magmas | 46 |
On ωsub1complete filters | 62 |
a position paper | 66 |
Temporal expressive completeness in the presence of gaps | 89 |
New foundations for mathematical theories | 122 |
Gentzentype systems and resolution rule Part II Predicate logic | 163 |
An intuitionistic theory of lawlike choice and lawless sequences | 191 |
Sense and denotation as algorithm and value | 210 |
A transfinite version of Puiseuxs theorem with applications to real closed fields | 250 |
On similarities of complete theories | 259 |
Decidability questions for theories of modules | 266 |
On CH + 2supalephsub1 alphasup2sub2 for alpha ωsub2 | 281 |
On the structure of gamma degrees | 290 |
Absoluteness for projective sets | 145 |
A division algorithm for the free left distributive algebra | 155 |
Other editions - View all
Common terms and phrases
A-graft algebra algorithm arbitrary assume assumption atomic supertype axiom bºo cardinal complete theory computation constituent construction corresponding countable D. M. GABBAY defined definition degrees denote derivation elementary embeddings equivalent example exists free variables Gentzen-type Hence holds identity implies indecomposable induction hypothesis infinite initial clauses initial segment integer irreflexivity isomorphism k-type L)-structures labels language lawlike left P gap Lemma linear order logic LPCR Math Mathematics maximal minimal modal modal logic model theory modules modus ponens natural numbers notion p-DF pair partial function Peano arithmetic predicate predicate logic proof propositional prove Q gap quantifiers R-modules real closed field realizes-V recursive set recursor referential intension relation relevance logic representation type result rule satisfied semantics sentences structure subset superatomic supertype temporal formula temporal logic Th(M Theorem truth value unranked winning strategy