Book contents
- Frontmatter
- Preface
- Contents
- SURVEY ARTICLES
- RESEARCH ARTICLES
- The intuitionistic arithmetical hierarchy
- On solvable groups and rings definable in o-minimal structures
- Logical topologies and semantic completeness
- Valued fields and elimination of imaginaries
- Simple sets and ideals under m-reducibility
- Borel irreducibility between two large families of Borel equivalence relations
- Linear logic as a framework for specifying sequent calculus
- Kripke models of certain subtheories of Heyting Arithmetic
- From bounded structural rules to linear logic modalities
- A description of the non-sequential execution of Petri nets in partially commutative linear logic
- A very slow growing hierarchy for
- References
Logical topologies and semantic completeness
from RESEARCH ARTICLES
Published online by Cambridge University Press: 30 March 2017
Book contents
- Frontmatter
- Preface
- Contents
- SURVEY ARTICLES
- RESEARCH ARTICLES
- The intuitionistic arithmetical hierarchy
- On solvable groups and rings definable in o-minimal structures
- Logical topologies and semantic completeness
- Valued fields and elimination of imaginaries
- Simple sets and ideals under m-reducibility
- Borel irreducibility between two large families of Borel equivalence relations
- Linear logic as a framework for specifying sequent calculus
- Kripke models of certain subtheories of Heyting Arithmetic
- From bounded structural rules to linear logic modalities
- A description of the non-sequential execution of Petri nets in partially commutative linear logic
- A very slow growing hierarchy for
- References
Summary
A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- Chapter
- Information
- Logic Colloquium '99 , pp. 68 - 79Publisher: Cambridge University PressPrint publication year: 2004
References
[1995] , , and , A first-order axiomatization of the theory of finite trees, Journal of Logic, Language and Information, vol. 4 (1995), pp. 5-39.Google Scholar
[1985] and (editors), Model-theoretic logics,, Springer-Verlag, New York, 1985.
[1996] , , and , Cauchy completeness in elementary logic, The Journal of Symbolic Logic, vol. 61 (1996), no. 4, pp. 1153-1157.Google Scholar
[1987] , Completeness and definability: Applications of the Ehrenfeucht game in intensional and second-order logic, Ph.D. thesis, Department of Mathematics and Computer Science, University of Amsterdam, 1987.
[1994] , , and , Mathematical logic, 2nd ed., Springer- Verlag, Berlin, 1994.
[1985] , General topology, 2nd ed., PWN,Warsaw, 1985.
[1967] , Course de logique mathématique, Gauthier-Villars, Paris, 1967.
[1985] , On the role of the Baire category theorem and dependent choice in the foundations of logic, The Journal of Symbolic Logic, vol. 50 (1985), pp. 412-422.Google Scholar
[1999] , Trees and finite branching, Proceedings of the second panhellenic logic symposium ( and , editors), 1999, pp. 107-111.Google Scholar
[1993] ,Model theory, Cambridge University Press, Cambridge, 1993.
[1963] and , The mathematics of metamathematics, PWN, Warsaw, 1963.
[1983] , Modal logic and classical logic, Bibliopolis, Naples, 1983.
[1984], Correspondence theory, Handbook of philosophical logic ( and , editors), vol. 2, Reidel, Dordrecht, 1984, pp. 167-247.
[1993] , Completeness via completeness: Since and Until, Diamonds and defaults (, editor), Kluwer Academic Publishers, Dordrecht, 1993, pp. 279-286.