scientific article; zbMATH DE number 3076631
From MaRDI portal
zbMath0049.00504MaRDI QIDQ5815602
Publication date: 1952
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
LF+ in Coq for "fast and loose" reasoning, The logical structure of linguistic commitment. I: Four systems of non- relevant commitment entailment, Book review of: J. W. Garson, Modal logic for philosophers. 2nd ed., Natural deduction for the Sheffer stroke and Peirce's arrow (and any other truth-functional connective), Variants of the basic calculus of constructions, Vagueness as an epiphenomenon, and non-transitivity, Second-order logic of paradox, Proofs as Objects, Implementing Cantor’s Paradise, A Brief Overview of Mizar, Simplifying proofs in Fitch-style natural deduction systems, A model for belief revision, Natural deduction based upon strict implication for normal modal logics, Variable declarations in natural deduction, Natural deduction and Curry's paradox, Characteristics of de Bruijn’s early proof checker Automath, New axiomatics for relevant logics. I, The placeholder view of assumptions and the Curry-Howard correspondence, Truth, predication and a family of contingent paradoxes, The Barcan formulas and necessary existence: the view from quarc, Modal FRP for all: Functional reactive programming without space leaks in Haskell, TRANSLATIONS BETWEEN LINEAR AND TREE NATURAL DEDUCTION SYSTEMS FOR RELEVANT LOGICS, INCOMPLETENESS VIA PARADOX AND COMPLETENESS, Stanisław Jaśkowski: Life and Work, Stanisław Jaśkowski and Natural Deduction Systems, Reasoning processes in propositional logic, Unnamed Item, Language in action, Sets and plural comprehension, Moral dilemmas, disjunctive obligations, and Kant's principle that ``ought implies ``can, K3, Ł3, LP, RM3, A3, FDE, M: How to Make Many-Valued Logics Work for You, Generalisation of proof simulation procedures for Frege systems by M.L. Bonet and S.R. Buss, Flexary connectives in Mizar, Prior and possibly not existing, Logical foundations for programming semantics, Coquand's calculus of constructions: A mathematical foundation for a proof development system, Reasoning about truth in first-order logic, Gentzen and Jaśkowski natural deduction: fundamentally similar but importantly different, Normal proofs, cut free derivations and structural rules, A variant of Thomason's first-order logic CF based on situations, Automated search for Gödel's proofs, The translation of formal proofs into English, Introduction to Type Theory, Commentary and Illocutionary Expressions in Linear Calculi of Natural Deduction, Simulation of Natural Deduction and Gentzen Sequent Calculus, Translations between Gentzen-Prawitz and Jaśkowski-Fitch natural deduction proofs, Semantical analyses of propositional systems of Fitch and Nelson, The harmony of identity, Plugging-in proof development environments usingLocksinLF, A formal statement of the Einstein-Podolsky-Rosen argument, Symlog automated advice in Fitch-style proof construction, Prawitz, Proofs, and Meaning, General-Elimination Harmony and Higher-Level Rules, Fregean grammar: A formal outline, Modal dependent type theory and dependent right adjoints, Normality, non-contamination and logical depth in classical natural deduction, Logic of agreement: Foundations, semantic system and proof theory, Analytical tableaux for da Costa's hierarchy of paraconsistent logics Cn, 1≤n<ω, Human-centered automated proof search, Minlog: A minimal logic theorem prover, Unnamed Item, Semantics of Mizar as an Isabelle object logic, Proof assistants: history, ideas and future, Automated Improving of Proof Legibility in the Mizar System, Linear logic by levels and bounded time complexity, Noncumulative dialectical models and formal dialectics, Semantic closure, Diamonds are a philosopher's best friends. The knowability paradox and modal epistemic relevance logic
