scientific article
From MaRDI portal
Publication:3285631
zbMath0102.24704MaRDI QIDQ3285631
Publication date: 1960
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (49)
Iterated reflection principles and the ω-rule ⋮ Structured algebraic specifications: A kernel language ⋮ Is cut-free logic fit for unrestricted abstraction? ⋮ A survey of proof theory ⋮ Nice embedding in classical logic ⋮ Well-Ordering Principles in Proof Theory and Reverse Mathematics ⋮ Resolution on formula-trees ⋮ Herbrand analyses ⋮ Uniform Gentzen systems ⋮ Levels of truth ⋮ Ein verallgemeinerter Widerlegungsbegriff für Gentzenkalküle ⋮ Completeness proofs for propositional logic with polynomial-time connectives ⋮ Systems of predicative analysis ⋮ Sequent systems for negative modalities ⋮ Paraconsistent constructive logic with strong negation as a contraction-free relevant logic ⋮ ABSTRACT FORMS OF QUANTIFICATION IN THE QUANTIFIED ARGUMENT CALCULUS ⋮ Two, Many, and Differently Many ⋮ Gentzen reduction revisited ⋮ Proof-theoretical analysis: Weak systems of functions and classes ⋮ Recent Advances in Ordinal Analysis: Π12— CA and Related Systems ⋮ The ω-consistency of number theory via Herbrand's theorem ⋮ Ordinal bounds for κ-consistency ⋮ Sufficient conditions for cut elimination with complexity analysis ⋮ K3, Ł3, LP, RM3, A3, FDE, M: How to Make Many-Valued Logics Work for You ⋮ The Truth of Proof: A Hegelian Perspective on Constructivism ⋮ Annotated Natural Deduction for Adaptive Reasoning ⋮ Logical foundations for programming semantics ⋮ New Arguments for Adaptive Logics as Unifying Frame for the Defeasible Handling of Inconsistency ⋮ An ordinal analysis of stability ⋮ Syntactical and semantical properties of simple type theory ⋮ The relation of A to Prov ˹A˺ in the Lindenbaum sentence algebra ⋮ A procedural criterion for final derivability in inconsistency-adaptive logics ⋮ Proof theory and ordinal analysis ⋮ Notation systems for infinitary derivations ⋮ Deduction chains for common knowledge ⋮ Ordinals connected with formal theories for transfinitely iterated inductive definitions ⋮ PROOF-THEORETIC ANALYSIS OF THE QUANTIFIED ARGUMENT CALCULUS ⋮ Tutorial on Inconsistency-Adaptive Logics ⋮ DECIDABILITY OF ADMISSIBILITY: ON A PROBLEM BY FRIEDMAN AND ITS SOLUTION BY RYBAKOV ⋮ “Sehr geehrter Herr Professor!” Proof Theory in 1949 in a Letter from Schütte to Bernays ⋮ … and so on: Schütte on Naming Ordinals ⋮ Beziehungen des Ordinalzahlensystems OT(ϑ) zur Veblen-Hierarchie ⋮ A systematic study of models of abstract data types ⋮ Extensional interpretations of modal logics ⋮ A uniform semantic proof for cut-elimination and completeness of various first and higher order logics. ⋮ Transfinite induction and bar induction of types zero and one, and the role of continuity in intuitionistic analysis ⋮ Toward useful type-free theories. I ⋮ On Blass translation for Leśniewski's propositional ontology and modal logics ⋮ THE PREHISTORY OF THE SUBSYSTEMS OF SECOND-ORDER ARITHMETIC
This page was built for publication:
