Untersuchungen über das logische Schliessen. II
From MaRDI portal
Publication:1840143
DOI10.1007/BF01201363zbMath0010.14601WikidataQ55868639 ScholiaQ55868639MaRDI QIDQ1840143
Publication date: 1934
Published in: Mathematische Zeitschrift (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/168556
Related Items (99)
Proof-theoretic semantics, a problem with negation and prospects for modality ⋮ Dialogues and Proofs; Yankov’s Contribution to Proof Theory ⋮ Proof Theory in Philosophy of Mathematics ⋮ Category theory, logic and formal linguistics: some connections, old and new ⋮ On the complexity of proof deskolemization ⋮ SN and CR for free-style LKtq: linear decorations and simulation of normalization ⋮ MELL in the calculus of structures ⋮ General proof theory: introduction ⋮ The \textsf{nanoCoP 2.0} connection provers for classical, intuitionistic and modal logics ⋮ Hilbert’s Axiomatisches Denken ⋮ An Analytic Propositional Proof System on Graphs ⋮ The Lambek calculus extended with intuitionistic propositional logic ⋮ FULL LAMBEK CALCULUS WITH CONTRACTION IS UNDECIDABLE ⋮ Between Hilbert and Gentzen: four-valued consequence systems and structural reasoning ⋮ Infinite-Valued First-Order Łukasiewicz Logic: Hypersequent Calculi Without Structural Rules and Proof Search for Sentences in the Prenex Form ⋮ Consequence and confirmation ⋮ Strong negation in intuitionistic style sequent systems for residuated lattices ⋮ Kneale's natural deductions as a notational variant of Beth's tableaus ⋮ THE JACOBSON RADICAL OF A PROPOSITIONAL THEORY ⋮ Characterizing Propositional Proofs as Noncommutative Formulas ⋮ On the generation of quantified lemmas ⋮ Mechanising Gödel-Löb provability logic in HOL light ⋮ Eliminating disjunctions by disjunction elimination ⋮ The predictive role of counterfactuals ⋮ Analyticity, balance and non-admissibility of \textit{Cut} in stoic logic ⋮ A sequent calculus for a negative free logic ⋮ Unnamed Item ⋮ An alternative Gentzenisation of RW+∘ ⋮ A postulate-driven study of logical argumentation ⋮ The elimination of maximum cuts in linear logic and BCK logic ⋮ ELIMINATING DISJUNCTIONS BY DISJUNCTION ELIMINATION ⋮ Metalogic, Schopenhauer and Universal Logic ⋮ On the computational complexity of cut-reduction ⋮ Free modal Riesz spaces are Archimedean: a syntactic proof ⋮ Requiem for logical nihilism, or: logical nihilism annihilated ⋮ On the compressibility of finite languages and formal proofs ⋮ Deductive Completeness ⋮ Unnamed Item ⋮ Arithmetizing uniform \(NC\) ⋮ On the relationship between compact regularity and Gentzen's cut rule ⋮ The Impact of the Lambda Calculus in Logic and Computer Science ⋮ Towards a clausal analysis of cut-elimination ⋮ The disjunction property of intermediate propositional logics ⋮ Extraction of expansion trees ⋮ Through an Inference Rule, Darkly ⋮ Point-Free Spectra of Linear Spreads ⋮ Natural deduction bottom up ⋮ Structural weakening and paradoxes ⋮ Proof theory for heterogeneous logic combining formulas and diagrams: proof normalization ⋮ A new deconstructive logic: linear logic ⋮ Herbrand's theorem as higher order recursion ⋮ On the intuitionistic force of classical search (Extended abstract) ⋮ Generalisation of proof simulation procedures for Frege systems by M.L. Bonet and S.R. Buss ⋮ Identity of Proofs Based on Normalization and Generality ⋮ Physics and proof theory ⋮ Cut-elimination and redundancy-elimination by resolution ⋮ On Hilbert's Axiomatics of Propositional Logic ⋮ The computational content of arithmetical proofs ⋮ External and internal syntax of the \(\lambda \)-calculus ⋮ Cut-elimination: syntax and semantics ⋮ Cut Elimination in a Class of Sequent Calculi for Pure Type Systems ⋮ Interactive Realizability for second-order Heyting arithmetic with EM1 and SK1 ⋮ Inferentializing semantics ⋮ 2003 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquim '03 ⋮ CERES in higher-order logic ⋮ The justification of the logical laws revisited ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Derivability of admissible rules ⋮ Deduction search in calculi of general type ⋮ Sequential method in quantum logic ⋮ Somehow things do not relate: on the interpretation of polyadic second-order logic ⋮ Stoic Sequent Logic and Proof Theory ⋮ The Role of Structural Reasoning in the Genesis of Graph Theory ⋮ 2004 Summer Meeting of the Association for Symbolic Logic ⋮ A cut-free Gentzen-type system for the modal logic S5 ⋮ Calculi for many-valued logics ⋮ Harmony in Proof-Theoretic Semantics: A Reductive Analysis ⋮ Semantical Approach to Cut Elimination and Subformula Property in Modal Logic ⋮ A Generalization of Maksimova’s Criterion for the Disjunction Property ⋮ Hopeful monsters: a note on multiple conclusions ⋮ A NOTE ON THE CUT-ELIMINATION PROOF IN “TRUTH WITHOUT CONTRA(DI)CTION” ⋮ The normalization theorem for extended natural deduction ⋮ Human-centered automated proof search ⋮ Harmony and autonomy in classical logic ⋮ Deduction normalization theorem for Sette's logic and its modifications ⋮ Ordering groups constructively ⋮ Eight inference rules for implication ⋮ Logic-Free Reasoning in Isabelle/Isar ⋮ Oskar Becker and the modal translation of intuitionistic logic ⋮ 1999–2000 Winter Meeting of the Association for Symbolic Logic ⋮ CUT ELIMINATION AND NORMALIZATION FOR GENERALIZED SINGLE AND MULTI-CONCLUSION SEQUENT AND NATURAL DEDUCTION CALCULI ⋮ Connecting Sequent Calculi with Lorenzen-Style Dialogue Games ⋮ Programs and logics ⋮ THE ELIMINATION OF ATOMIC CUTS AND THE SEMISHORTENING PROPERTY FOR GENTZEN’S SEQUENT CALCULUS WITH EQUALITY ⋮ Normalisation and subformula property for a system of classical logic with Tarski's rule ⋮ Towards a Proof Theory for Heterogeneous Logic Combining Sentences and Diagrams ⋮ Gentzen calculi for the existence predicate ⋮ Resourceful program synthesis from graded linear types
This page was built for publication: Untersuchungen über das logische Schliessen. II
