Untersuchungen über das logische Schliessen. I
From MaRDI portal
Publication:1840142
DOI10.1007/BF01201353zbMath0010.14501OpenAlexW2039977878WikidataQ55871200 ScholiaQ55871200MaRDI QIDQ1840142
Publication date: 1934
Published in: Mathematische Zeitschrift (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/168546
Related Items
Proof theory for minimal quantum logic. I, Verifying safety properties of a nonlinear control by interactive theorem proving with the prototype verification system, Category theory, logic and formal linguistics: some connections, old and new, Accelerating tableaux proofs using compact representations, Evidence algorithm and inference search in first-order logics, Semi-intelligible Isar proofs from machine-generated proofs, Natural deduction for the Sheffer stroke and Peirce's arrow (and any other truth-functional connective), Syntactical investigations into \(BI\) logic and \(BB^ \prime I\) logic, Logic reduced to bare (proof-theoretical) bones, Adjointness of fuzzy systems, Intermediate logics with the same disjunctionless fragment as intuitionistic logic, Resolution on formula-trees, Hybridizing nonmonotonic inheritance with theorem proving, A weak intuitionistic propositional logic with purely constructive implication, A deficiency of natural deduction, The Lambek calculus extended with intuitionistic propositional logic, A logical approach to stable domains, Hypersequent rules with restricted contexts for propositional modal logics, Variable declarations in natural deduction, Gentzen-type formulation of the propositional logic LQ, SAD as a mathematical assistant -- how should we go from here to there?, Sequent-systems and groupoid models. I, Does the deduction theorem fail for modal logic?, ``Inference versus consequence revisited: inference, consequence, conditional, implication, Graphs of plural cuts, Semantics and proof-theory of depth bounded Boolean logics, First degree entailments, A new formulation of discussive logic, Algorithmic introduction of quantified cuts, Dialogue structure and logical expressivism, Reflecting rules: a note on generalizing the deduction theorem, Solvable classes of pseudoprenex formulas, \(\lim +, \delta^+\), and non-permutability of \(\beta\)-steps, On the computational complexity of cut-reduction, Cut elimination and strong separation for substructural logics: an algebraic approach, A minimal classical sequent calculus free of structural rules, Completeness and partial soundness results for intersection and union typing for \(\overline{\lambda}\mu\tilde{\mu}\), Some work of Lithuanian mathematicians in the domain of mathematical logic and programming, Proof-theoretical analysis: Weak systems of functions and classes, The deducibilities of S5, A new reduction sequence for arithmetic, Lower bounds for increasing complexity of derivations after cut elimination, On the elimination of quantifier-free cuts, A simplified problem reduction format, Intermediaries and intervenients in normative systems, Resolution proof transformation for compression and interpolation, On the concept of finitism, Lambek calculus with restricted contraction and expansion, Assertion, denial, content, and (logical) form, Conventionalism, consistency, and consistency sentences, Conflict resolution: a first-order resolution calculus with decision literals and conflict-driven clause learning, Gentzen-style sequent calculus for semi-intuitionistic logic, The relativity and universality of logic, On Dummett's verificationist justification procedure, General-elimination stability, New consecution calculi for \(R^{t}_{\to}\), Bounds for cut elimination in intuitionistic propositional logic, Coherence for modalities, The first axiomatization of relevant logic, The simple substitution property of the intermediate propositional logics on finite slices, Not necessarily distributive fuzzy semantics for multiple-conclusion sequent calculi with weak structural rules, Resolution is cut-free, Sur une logique intuitionniste, A formal system of partial recursive functions, Inferentializing semantics, On the idea of a general proof theory, On the (fuzzy) logical content of CADIAG-2, Extension without cut, PNL to HOL: from the logic of nominal sets to the logic of higher-order functions, CERES in higher-order logic, Abstract deduction and inferential models for type theory, Unification in a combination of arbitrary disjoint equational theories, Equational axioms for classes of Heyting algebras, Non-resolution theorem proving, Theories with the independence property, Tableaux and dual tableaux: transformation of proofs, Sequential method in propositional dynamic logic, Types as graphs: Continuations in type logical grammar, Investigations into a left-structural right-substructural sequent calculus, Meaning and dialogue coherence: A proof-theoretic investigation, E theorems, Relevant analytic tableaux, The theory of empirical sequences, Coherence in linear predicate logic, Structured calculational proof, Describing proofs by short tautologies, The road to two theorems of logic, Harmonious logic: Craig's interpolation theorem and its descendants, Compatible operations on residuated lattices, Relevant identity, Cut elimination and word problems for varieties of lattices, On some proof theoretical properties of the modal logic GL, Are tableaux an improvement on truth-tables? Cut-free proofs and bivalence, A survey of multiple contractions, A uniform tableau method for intuitionistic modal logics. I, Proof theory for linear lattices, Incomplete symbols -- definite descriptions revisited, The constructive Hilbert program and the limits of Martin-Löf type theory, Gentzen calculi for the existence predicate, Towards a semantic characterization of cut-elimination, Credible autocoding of convex optimization algorithms, Logic and majority voting, Peirce's dragon-head logic (R 501, 1901), MELL in the calculus of structures, Variants of the basic calculus of constructions, The fundamental problem of general proof theory, Is there a ``Hilbert thesis?, A note on the proof theory of the \(\lambda \Pi\)-calculus, Semantics for intuitionistic epistemic logics of shallow depths for game theory, Calculi of epistemic grounding based on Prawitz's theory of grounds, Meaning and computing: two approaches to computable propositions, A canonical locally named representation of binding, Remarques sur la notion de la perfection, Sur les formes normales, Indexed systems of sequents and cut-elimination, Kneale's natural deductions as a notational variant of Beth's tableaus, Economic reasoning with demand and supply graphs, Book review of: R. Kahle (ed.) and M. Rathjen (ed.), Gentzen's centenary. The quest for consistency, Revisiting Quine on truth by convention, The problem of \(\Pi_{2}\)-cut-introduction, Intuitive minimal abduction in sequent calculi, Distributive-lattice semantics of sequent calculi with structural rules, Many-place sequent calculi for finitely-valued logics, The diagrams of formulas of the modal propositional S4 calculus, Instability and contraction. \textit{Méditations hégéliennes}. I, Eliminating disjunctions by disjunction elimination, Intuitionism and effective descriptive set theory, Bilateralism does not provide a proof theoretic treatment of classical logic (for technical reasons), What is the logic of inference?, Guest editor's introduction: JvH100, Editor's introduction to Jean van Heijenoort, ``Historical development of modern logic, Historical development of modern logic, IeanCOP: lean connection-based theorem proving, Proof search and co-NP completeness for many-valued logics, Meaning as an inferential role, Quine and Slater on paraconsistency and deviance, Naive structure, contraction and paradox, Sequent calculus for classical logic probabilized, Repetition-free and infinitary analytic calculi for first-order rational Pavelka logic, Grammar induction by unification of type-logical lexicons, Four-valued logic, Skew lattices and binary operations on functions, Knowledge, belief, normality, and introspection, E-generalization using grammars, Maehara-style modal nested calculi, On argumentation logic and propositional logic, Proof-theoretic semantics and inquisitive logic, On partial disjunction properties of theories containing Peano arithmetic, Direct proofs of Lindenbaum conditionals, Plausible reasoning and graded information: a unified approach, On the unity of duality, Gentzen and Jaśkowski natural deduction: fundamentally similar but importantly different, Normal proofs, cut free derivations and structural rules, From axiomatic logic to natural deduction, Hypersequent and display calculi -- a unified perspective, A survey of nonstandard sequent calculi, Subatomic natural deduction for a naturalistic first-order language with non-primitive identity, Decision methods for linearly ordered Heyting algebras, Herbrand's theorem and term induction, Regaining cut admissibility in deduction modulo using abstract completion, A proof-theoretical investigation of global intuitionistic (fuzzy) logic, Semantic bootstrapping of type-logical grammar, Sequent forms of Herbrand theorem and their applications, Linear axiomatics of commutative product-free Lambek calculus, Computing interpolants in implicational logics, Disjunctive and conjunctive multiple-conclusion consequence relations, The harmony of identity, The multiplicative-additive Lambek calculus with subexponential and bracket modalities, Dag Prawitz on proofs, operations and grounding, Calculi for many-valued logics, The middle ground-ancestral logic, Non-well-founded deduction for induction and coinduction, The simple substitution property of Gödel's intermediate propositional logics \(S_ n\)'s, Normality, non-contamination and logical depth in classical natural deduction, The calculus of natural calculation, Key notions of Tarski's methodology of deductive systems, Intuitionism: an inspiration?, Combining fragments of classical logic: when are interaction principles needed?, On the intuitionistic force of classical search, Proof-search in type-theoretic languages: An introduction, Reduction of finite and infinite derivations, The revival of rejective negation, Five observations concerning the intended meaning of the intuitionistic logical constants, Weight of the comprehension axiom in a theory based on logic without contractions, Lyndon interpolation theorem of instantial neighborhood logic-constructively via a sequent calculus, A formalization of the modal propositional S4 calculus, A formalization of the propositional calculus of H-B logic, Steps towards a proof-theoretical semantics, Integrating induction and coinduction via closure operators and proof cycles, Order-enriched categorical models of the classical sequent calculus, Gödel, Gentzen, Goodstein: the magic sound of a G-string, Streams and strings in formal proofs., Structural cut elimination. I: Intuitionistic and classical logic, A uniform procedure for converting matrix proofs into sequent-style systems, Contrary-to-duty reasoning: a categorical approach, Inductive theorem proving based on tree grammars, Church-Rosser property of a simple reduction for full first-order classical natural deduction, Admissibility via natural dualities, Peirce's rule in natural deduction., Denotational semantics for languages of epistemic grounding based on Prawitz's theory of grounds, Propositional Calculus and Realizability, Recursive Functions and Intuitionistic Number Theory, On a Method of Describing Formal Deductions Convenient for Theoretical Purposes, A Stronger System of Object Theory as a Prototype of Set Theory, New Formulation of the Axiom of Choice by making use of the Comprehension Operator, The implicational fragment of $R$-mingle, ABSTRACT FORMS OF QUANTIFICATION IN THE QUANTIFIED ARGUMENT CALCULUS, Mechanising Gödel-Löb provability logic in HOL light, Mechanical certification of \(\mathrm{FOL_{ID}}\) cyclic proofs, The placeholder view of assumptions and the Curry-Howard correspondence, Intuitionistic mereology, Proof-theoretic pluralism, Where is ‘There is’ in ‘∃’?, Lorenzen's Proof of Consistency for Elementary Number Theory, Classical (co)recursion: Mechanics, Complementary proof nets for classical logic, A Sequent Systems without Improper Derivations, A note on Schütte's interpolation theorem, On some properties of intermediate logics, Relating reasoning methodologies in linear logic and process algebra, On the semantics of classical disjunction, Asymptotic cyclic expansion and bridge groups of formal proofs, Fuzzy semantics for multiple-conclusion sequential calculi with structural rules, Unnamed Item, MBase: Representing knowledge and context for the integration of mathematical software systems, Eine Darstellung der Intuitionistischen Logik in der Klassischen, Über die Zwischensysteme der Aussagenlogik, Recursive Functions and Intuitionistic Number Theory, Almost all Classical Theorems are Intuitionistic, Formal software development in the Verification Support Environment (VSE), GÖDEL’S NOTRE DAME COURSE, MOIN: A Nested Sequent Theorem Prover for Intuitionistic Modal Logics (System Description), Axiomatic Thinking, Identity of Proofs and the Quest for an Intensional Proof-Theoretic Semantics, On Enumerating Query Plans Using Analytic Tableau, Contextual Natural Deduction, An Analytic Propositional Proof System on Graphs, Back to futures, A Logical Interpretation of the λ-Calculus into the π-Calculus, Preserving Spine Reduction and Types, FULL LAMBEK CALCULUS WITH CONTRACTION IS UNDECIDABLE, Herbrand style proof procedures for modal logic, Algorithmic Theories of Problems. A Constructive and a Non-Constructive Approach, Proofs, Upside Down, ILF-SETHEO, The Cut Elimination Theorem in the Unary Second Order Language, Natural deduction for intuitionistic Euler-Venn diagrams, Structural Focalization, On the Power of Substitution in the Calculus of Structures, Judgement aggregation in non-classical logics, TRUTH WITHOUT CONTRA(DI)CTION, JUXTAPOSITION: A NEW WAY TO COMBINE LOGICS, WEAKLY CLASSICAL THEORIES OF IDENTITY, Editorial introduction: substructural logics and metainferences, SEVENTEENTH-CENTURY SCHOLASTIC SYLLOGISTICS. BETWEEN LOGIC AND MATHEMATICS?, In Praise of Impredicativity: A Contribution to the Formalization of Meta-Programming, On the cut operation in Gentzen calculi, An alternative Gentzenisation of RW+∘, ELIMINATING DISJUNCTIONS BY DISJUNCTION ELIMINATION, On Inversion Principles, Computation with classical sequents, Popper's Notion of Duality and His Theory of Negations, From Gentzen to Jaskowski and Back: Algorithmic Translation of Derivations Between the Two Main Systems of Natural Deduction, Three faces of natural deduction, Non-elementary speed-ups in proof length by different variants of classical analytic calculi, Unnamed Item, On Natural Deduction for Herbrand Constructive Logics I: Curry-Howard Correspondence for Dummett's Logic LC, Stanisław Jaśkowski: Life and Work, Stanisław Jaśkowski and Natural Deduction Systems, Disjunctive Multiple-Conclusion Consequence Relations, Unnamed Item, Unnamed Item, A Critical Overview of the Most Recent Logics of Grounding, Which Quantifiers Are Logical? A Combined Semantical and Inferential Criterion, Topology and logic as a source of algebra, Multi-focused cut elimination, First-Degree Entailment and Structural Reasoning, Note on the Benefit of Proof Representations by Name, Through an Inference Rule, Darkly, The Concepts of Proof and Ground, Point-Free Spectra of Linear Spreads, A SEQUENT CALCULUS ISOMORPHIC TO GENTZEN’S NATURAL DEDUCTION, BOLZANO’S CONCEPT OF GROUNDING (ABFOLGE) AGAINST THE BACKGROUND OF NORMAL PROOFS, Proof-terms for classical and intuitionistic resolution, Combining many-valued and intuitionistic tableaux, A timing refinement of intuitionistic proofs and its application to the timing analysis of combinational circuits, Generalisation of proof simulation procedures for Frege systems by M.L. Bonet and S.R. Buss, Presenting machine-found proofs, Strenge Beweise und das Verbot dermetábasis eis állo génos, A Brief History of Natural Deduction, Correct Answers for First Order Logic, Learnability of type-logical grammars, On a Practical Way of Describing Formal Deductions, On categorical models of classical logic and the Geometry of Interaction, Unnamed Item, Commentary and Illocutionary Expressions in Linear Calculi of Natural Deduction, Simulation of Natural Deduction and Gentzen Sequent Calculus, FORMULAS IN MODAL LOGIC S4, The problem of proof identity, and why computer scientists should care about Hilbert's 24th problem, The Role of Structural Reasoning in the Genesis of Graph Theory, Towards an algorithmic construction of cut-elimination procedures, Reconstructing proofs at the assertion level, Explaining Deductive Inference, Cut Elimination, Substitution and Normalisation, Meaning in Use, Revising a Labelled Sequent Calculus for Public Announcement Logic, Automating Soundness Proofs, Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent, Unnamed Item, FRACTIONAL SEMANTICS FOR CLASSICAL LOGIC, RULES FOR SUBATOMIC DERIVATION, 2005 Annual Meeting of the Association for Symbolic Logic, The Dedekind reals in abstract Stone duality, Compatible operations on commutative residuated lattices, INVERSION BY DEFINITIONAL REFLECTION AND THE ADMISSIBILITY OF LOGICAL RULES, Nineteenth Century British Logic on Hypotheticals, Conditionals, and Implication, Some pitfalls of LK-to-LJ translations and how to avoid them, Resource-distribution via Boolean constraints, Ordering groups constructively, Automating Theories in Intuitionistic Logic, Coherence in Nonmonoidal Closed Categories, CONSTRUCTIVE CLASSICAL LOGIC AS CPS-CALCULUS, The finite embeddability property for noncommutative knotted extensions of RL, A Certain Kind of Formal Theories, Dialogue Games for Minimal Logic, From Schütte’s Formal Systems to Modern Automated Deduction, The Sequent Calculus of Skew Monoidal Categories, On the Computational Representation of Classical Logical Connectives, Extensional interpretations of modal logics, Deduction Graphs with Universal Quantification, CALCULIZING CLASSICAL INFERENTIAL EROTETIC LOGIC
