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
First order logics of individual theories
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. 200 - 208Publisher: Cambridge University PressPrint publication year: 2004
References
[1] and , On first-order theories with provability operator, The Journal of Symbolic Logic, vol. 59 (1994), no. 4, pp. 1139-1153.Google Scholar
[2] , Teorija modelej unitreugol'nykh i ekzistencial'no zamknutykh grupp, Ph.D. thesis, Novosibirsk State University, 1995.
[3] , Problemy razreshimosti i konstruktivnye modeli, Nauka, Moscow, 1980, (in Russian).
[4] , Arithmetization of metamathematics in a general setting, Fundamenta Mathematicae, vol. 49 (1960), pp. 35-92.Google Scholar
[5] and , Grundlagen der Mathematik, vol. 2, Springer-Verlag, New York Berlin Heidelberg Tokio, 1968.
[6] , Introduction to metamathematics, Inostrannaya Literatura,Moscow, 1957.
[7] , Deduktivnaya obshcheznachimost' i klassy svedenija, Matematicheskie Zametki, vol. 4 (1967), pp. 69-77. (in Russian).
[8] , Nekotorye varianty ponyatija realizuemosti dlya predikatnykh formul, Izvestiya Akademii Nauk SSSR, vol. 42 (1978), no. 3, pp. 636-653. (in Russian).
[9] , Konstruktivnaya formalizaciya teoremy Tennenbauma i ee primenenie, Matematicheskie Zametki, vol. 48 (1990), no. 3, pp. 108-118.Google Scholar
[10] , Ob arfmeticheskoj slozhnosti nekotorykh predikatnykh logik, Matematicheskie Zametki, vol. 52 (1992), no. 1, pp. 94-104. (in Russian).
[11] , Definability and decision problem in arithmetic, The Journal of Symbolic Logic, vol. 14 (1949), no. 2, pp. 98-114.Google Scholar
[12] , Predikatnaya logika dokazuemosti bez dokazuemosti, Intensionalnye logiki i logicheskaya struktura teorii (Tbilisi), 1988, (in Russian), pp. 65-69.
[13] , Logical schemes for first order theories, Logical foundations of computer science ( and , editors), Lecture Notes in Computer Science, vol. 1234, Springer-Verlag, Berlin Heidelberg, July 1997, pp. 410-418.
[14] , Predikatnye logiki razreshimih fragmentov arifmetiki, VestnikMoskovskogo Universiteta. Matematika. Mekhanika, (1998), no. 2, pp. 12-16. (in Russian).
[15] , Razreshimie logiki pervogo poryadka, Fundamental'naya i Prikladnaya Matematika, vol. 4 (1998), no. 2, pp. 733-749. (in Russian).
[16] , Predikatnye logiki vyrazitelno silnykh teorij, Matematicheskie Zametki, vol. 66 (1999), no. 5, pp. 777-788. (in Russian).