scientific article; zbMATH DE number 3572133
From MaRDI portal
zbMath0367.02012MaRDI QIDQ4143279
Publication date: 1977
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Proof theory and constructive mathematics (03F99)
Related Items
Inaccessible set axioms may have little consistency strength, Reflection algebras and conservation results for theories of iterated truth, Proof theory of reflection, Is cut-free logic fit for unrestricted abstraction?, Confluence of the coinductive \(\lambda\)-calculus, A comparison of well-known ordinal notation systems for \(\varepsilon _{0}\), Completeness of a cut-free calculus with equality and function constants, Elementary descent recursion and proof theory, First-order theories for pure Prolog programs with negation, Ein in der reinen Zahlentheorie unbeweisbarer Satz über endliche Folgen von natürlichen Zahlen, Gentzen's consistency proof without heightlines, Majorizing provably recursive functions in fragments of PA, Combinatory logic with polymorphic types, A semantics for \(\lambda \)Prolog, Asymptotic distribution of integers with certain prime factorizations, Algorithmically broad languages for polynomial time and space, Induktive Definitionen und Dilatoren. (Inductive definitions and dilators), From single agent to multi-agent via hypersequents, Ordinal notations based on a hierarchy of inaccessible cardinals, Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones, Second order theories with ordinals and elementary comprehension, Derivatives of normal functions and \(\omega \)-models, On the number of steps in proofs, A decidable theory of type assignment, Systems of explicit mathematics with non-constructive \(\mu\)-operator. II, Hyperations, Veblen progressions and transfinite iteration of ordinal functions, Beweistheoretische Abgrenzung von Teilsystemen der Analysis, On the proof-theory of two formalisations of modal first-order logic, The proof-theoretic analysis of \(\Sigma_{1}^{1}\) transfinite dependent choice, Classical predicative logic-enriched type theories, Type-theoretic approaches to ordinals, How to assign ordinal numbers to combinatory terms with polymorphic types, Ordinal notations based on a weakly Mahlo cardinal, Derivatives of normal functions in reverse mathematics, Between constructive mathematics and PROLOG, Well-Partial Orderings and their Maximal Order Types, The Possibility of Analysis: Convergence and Proofs of Convergence, Loop-type sequent calculi for temporal logic, The Proof Theory of Common Knowledge, What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory, Ordinal Analysis of Intuitionistic Power and Exponentiation Kripke Platek Set Theory, From Subsystems of Analysis to Subsystems of Set Theory, On Relating Theories: Proof-Theoretical Reduction, On behavioural abstraction and behavioural satisfaction in higher-order logic, Termination proofs for term rewriting systems by lexicographic path orderings imply multiply recursive derivation lengths, Term rewriting theory for the primitive recursive functions, Fast growing functions based on Ramsey theorems, Simplified collapsing functions and their applications, A new mapping between combinatorial proofs and sequent calculus proofs read out from logical flow graphs, An approach to infinitary temporal proof theory, Proof-theoretic investigations on Kruskal's theorem, Fixed points in Peano arithmetic with ordinals, A survey of nonstandard sequent calculi, On the relationship between fixed points and iteration in admissible set theory without foundation, ϱ-inaccessible ordinals, collapsing functions and a recursive notation system, Herbrand's theorem and term induction, An ordinal analysis for theories of self-referential truth, Continuous normalization for the lambda-calculus and Gödel's T, About cut elimination for logics of common knowledge, An ordinal analysis of parameter free \(\Pi^{1}_{2}\)-comprehension, Syntactic cut-elimination for a fragment of the modal mu-calculus, \(\Pi_1^1\)-comprehension as a well-ordering principle, Proof theory and ordinal analysis, Notation systems for infinitary derivations, Deduction chains for common knowledge, Beweistheorie vonKPN, Pure \(\Sigma_2\)-elementarity beyond the core, Patterns of resemblance of order 2, Some combinatorial principles equivalent to restrictions of transfinite induction up to \(\Gamma _ 0\), WEYL REEXAMINED: “DAS KONTINUUM” 100 YEARS LATER, Wittgensteinian tableaux, identity, and co-denotation, Lexicographic Path Induction, Complexity of Gödel’s T in λ-Formulation, Proof-theoretic strengths of the well-ordering principles, Harmonious logic: Craig's interpolation theorem and its descendants, Full operational set theory with unbounded existential quantification and power set, Syntactic cut-elimination for common knowledge, The calculus of natural calculation, Reverse mathematics and well-ordering principles: a pilot study, The unfolding of non-finitist arithmetic, Reduction of finite and infinite derivations, The non-constructive \(\mu\) operator, fixed point theories with ordinals, and the bar rule, Systems of explicit mathematics with non-constructive \(\mu\)-operator and join, Completeness of the primitive recursive \(\omega \)-rule, Replacement versus collection and related topics in constructive Zermelo-Fraenkel set theory, Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results, Well-ordering proofs for Martin-Löf type theory, Some results on cut-elimination, provable well-orderings, induction and reflection, Bar induction and \(\omega\) model reflection, Cut-elimination for impredicative infinitary systems part I. Ordinal-analysis for ID1, Fuzzy logic and fuzzy set theory, Barendregt's problem \#26 and combinatory strong reduction, Proof-theoretic analysis of KPM, Ackermannian Goodstein sequences of intermediate growth, Systems of explicit mathematics with non-constructive \(\mu\)-operator. I, On the proof theory of infinitary modal logic, Ordinal notations and well-orderings in bounded arithmetic, Universes over Frege structures, On Blass translation for Leśniewski's propositional ontology and modal logics, Collapsing functions based on recursively large ordinals: A well-ordering proof for KPM, Eine Variante Des OrdinalzahlbezeichnungssystemsΣ, PREDICATIVISM AS A FORM OF POTENTIALISM, Dialogues and Proofs; Yankov’s Contribution to Proof Theory, Zur Beweistheorie Der Kripke-Platek-Mengenlehre Über Den Natürlichen Zahlen, A NOTE ON FRAGMENTS OF UNIFORM REFLECTION IN SECOND ORDER ARITHMETIC, Well-Ordering Principles in Proof Theory and Reverse Mathematics, NONCLASSICAL TRUTH WITH CLASSICAL STRENGTH. A PROOF-THEORETIC ANALYSIS OF COMPOSITIONAL TRUTH OVER HYPE, The (Greatest) Fragment of Classical Logic that Respects the Variable-Sharing Principle (in the FMLA-FMLA Framework), Well ordering principles for iterated \(\Pi^1_1\)-comprehension, A note on ordinal exponentiation and derivatives of normal functions, PREDICATIVE COLLAPSING PRINCIPLES, The Π21$\Pi ^1_2$ consequences of a theory, ON ZARDINI’S RULES FOR MULTIPLICATIVE QUANTIFICATION AS THE SOURCE OF CONTRA(DI)CTIONS, POINCARÉ–WEYL’S PREDICATIVITY: GOING BEYOND, Set-theoretic reflection is equivalent to induction over well-founded classes, Non-elementary speed-ups in proof length by different variants of classical analytic calculi, HOW STRONG ARE SINGLE FIXED POINTS OF NORMAL FUNCTIONS?, Ramified Corecurrence and Logspace, Elementary patterns of resemblance, Sandwiches of ages, Über Teilsysteme von $$\bar \Theta $$ ({g}), Logical problems of functional interpretations, Derivation lengths and order types of Knuth--Bendix orders, A Survey on Ordinal Notations Around the Bachmann–Howard Ordinal, Iterated Inductive Definitions Revisited, Feferman and the Truth, CUT ELIMINATION IN HYPERSEQUENT CALCULUS FOR SOME LOGICS OF LINEAR TIME, Syntactic Cut-elimination for Common Knowledge, The Confluent Terminating Context-Free Substitutive Rewriting System for the lambda-Calculus with Surjective Pairing and Terminal Type, A well-ordering proof for Feferman's theoryT 0, “Sehr geehrter Herr Professor!” Proof Theory in 1949 in a Letter from Schütte to Bernays, Well-ordering Principles, ω-models and $$ \varPi_{1}^{1} $$-comprehension, Calculating Maximal Order Types for Finite Rooted Unstructured Labeled Trees, A Glimpse of $$ \sum_{3} $$-elementarity, Lorenzen Between Gentzen and Schütte, THE PREHISTORY OF THE SUBSYSTEMS OF SECOND-ORDER ARITHMETIC
