O druhém Hilbertově problému (Otázka bezespornosti aritmetiky)
Page 1 Next
Displaying 1 – 20 of 44
O struktuře modelů omezené -indukce
Jeff B. Paris (1984)
Časopis pro pěstování matematiky
On a connection between algebra, logic and linguistics
J. Lambek (1989)
Diagrammes
On a Foundation for Mathematics- a View of Mathematics I
Milan Đurić (1977)
Zbornik Radova
On a new method in intuitionist linear analysis
Sahab Lal Shukla (1973)
Compositio Mathematica
On a relationship between countable functionals and projective trees
Helmut Vogel (1983)
Fundamenta Mathematicae
On a unification problem related to Kreisel's conjecture
Pavel Pudlák (1988)
Commentationes Mathematicae Universitatis Carolinae
On a weakening of Markov's principle.
A. Scedrov, R. Vesley (1983)
Archiv für mathematische Logik und Grundlagenforschung
On an extremely restricted ω-rule
E. López-Escobar (1976)
Fundamenta Mathematicae
On computable real functions
Milena Lukavcová (1980)
Kybernetika
On constructive versions of the Tychonoff and Schauder fixed point theorems.
Tanaka, Yasuhito (2011)
Applied Mathematics E-Notes [electronic only]
On convergence of the Fourier series of a constructive function of weakly bounded variation
Pavel M. Filipec (1976)
Commentationes Mathematicae Universitatis Carolinae
On cut elimination in the presence of peirce rule.
L. Gordeev (1987)
Archiv für mathematische Logik und Grundlagenforschung
On effective speed-up and long proofs of trivial theorems in formal theories
J. Hartmanis (1976)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
On elementary cuts in models of arithmetic
Henryk Kotlarski (1983)
Fundamenta Mathematicae
On global induction mechanisms in a -calculus with explicit approximations
Christoph Sprenger, Mads Dam (2003)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
We investigate a Gentzen-style proof system for the first-order -calculus based on cyclic proofs, produced by unfolding fixed point formulas and detecting repeated proof goals. Our system uses explicit ordinal variables and approximations to support a simple semantic induction discharge condition which ensures the well-foundedness of inductive reasoning. As the main result of this paper we propose a new syntactic discharge condition based on traces and establish its equivalence with the semantic...
On global induction mechanisms in a μ-calculus with explicit approximations
Christoph Sprenger, Mads Dam (2010)
RAIRO - Theoretical Informatics and Applications
We investigate a Gentzen-style proof system for the first-order μ-calculus based on cyclic proofs, produced by unfolding fixed point formulas and detecting repeated proof goals. Our system uses explicit ordinal variables and approximations to support a simple semantic induction discharge condition which ensures the well-foundedness of inductive reasoning. As the main result of this paper we propose a new syntactic discharge condition based on traces and establish its equivalence with the semantic...
On hereditarily separable Hausdorff spaces in the constructible universe
Keith Devlin (1974)
Fundamenta Mathematicae
On independent recursive axiomatisation in intuitionistic logic
И. Резников (1967)
Algebra i Logika
On interpretability in theories containing arithmetic. II.
Petr Hájek (1981)
Commentationes Mathematicae Universitatis Carolinae
Currently displaying 1 – 20 of 44
Page 1 Next