Beweistheorie
From MaRDI portal
Cited in
(54)- Structured algebraic specifications: A kernel language
- Resolution on formula-trees
- Completeness proofs for propositional logic with polynomial-time connectives
- Gentzen reduction revisited
- A uniform semantic proof for cut-elimination and completeness of various first and higher order logics.
- Sequent systems for negative modalities
- An ordinal analysis of stability
- A procedural criterion for final derivability in inconsistency-adaptive logics
- Levels of truth
- On Blass translation for Leśniewski's propositional ontology and modal logics
- Is cut-free logic fit for unrestricted abstraction?
- Proof theory and ordinal analysis
- Notation systems for infinitary derivations
- Sufficient conditions for cut elimination with complexity analysis
- Deduction chains for common knowledge
- Herbrand analyses
- Nice embedding in classical logic
- 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
- Toward useful type-free theories. I
- Syntactical and semantical properties of simple type theory
- Iterated reflection principles and the ω-rule
- The ω-consistency of number theory via Herbrand's theorem
- Ordinal bounds for κ-consistency
- Ordinals connected with formal theories for transfinitely iterated inductive definitions
- Paraconsistent constructive logic with strong negation as a contraction-free relevant logic
- Recent Advances in Ordinal Analysis: Π12— CA and Related Systems
- New arguments for adaptive logics as unifying frame for the defeasible handling of inconsistency
- 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
- Well-Ordering Principles in Proof Theory and Reverse Mathematics
- The relation of A to Prov ˹A˺ in the Lindenbaum sentence algebra
- PROOF-THEORETIC ANALYSIS OF THE QUANTIFIED ARGUMENT CALCULUS
- Tutorial on Inconsistency-Adaptive Logics
- The prehistory of the subsystems of second-order arithmetic
- Systems of predicative analysis
- Two, Many, and Differently Many
- Extensional interpretations of modal logics
- Transfinite induction and bar induction of types zero and one, and the role of continuity in intuitionistic analysis
- A survey of proof theory
- Uniform Gentzen systems
- Ein verallgemeinerter Widerlegungsbegriff für Gentzenkalküle
- ABSTRACT FORMS OF QUANTIFICATION IN THE QUANTIFIED ARGUMENT CALCULUS
- Many-valued modalities and paraconsistency
- An Introduction to Lorenzen's ‘Algebraic and Logistic Investigations on Free Lattices’ (1951)
- A Generalized Notion of Refutation for Gentzen Calculi*
- Logical foundations for programming semantics
- Gödel's modal interpretation of intuitionistic logic and its proof theory
- Some remarks on two seminal approaches to paraconsistency: Stanisław Jaśkowski and Newton da Costa
- A systematic study of models of abstract data types
- Proof-theoretical analysis: Weak systems of functions and classes
This page was built for publication: Beweistheorie
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3285631)
