scientific article; zbMATH DE number 3275554

From MaRDI portal
Revision as of 03:34, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5559220

zbMath0173.00205MaRDI QIDQ5559220

Dag Prawitz

Publication date: 1965


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.





Related Items (only showing first 100 items - show all)

LF+ in Coq for "fast and loose" reasoningTHE AXIOM OF CHOICE IS FALSE INTUITIONISTICALLY (IN MOST CONTEXTS)From petri nets to linear logicIntuitive counterexamples for constructive fallaciesRIGOUR AND PROOFNegative predication and distinctnessIdentity and harmony and modalityOn feasible numbersThe placeholder view of assumptions and the Curry-Howard correspondenceAn ecumenical notion of entailmentWhen programs have to watch paint dryA dialogical route to logical pluralismCombinatorial flows as bicolored atomic flowsRELEVANCE FOR THE CLASSICAL LOGICIANVarieties of Relevant S5Analytic Non-Labelled Proof-Systems for Hybrid Logic: Overview and a couple of striking factsProof Compression and NP Versus PSPACE II: AddendumStateful Realizers for Nonstandard AnalysisAdding Negation to Lambda MuLogical multilateralismTRANSLATIONS BETWEEN LINEAR AND TREE NATURAL DEDUCTION SYSTEMS FOR RELEVANT LOGICSThe elimination of maximum cuts in linear logic and BCK logicA Sequent Systems without Improper DerivationsLinearity and uniqueness: an entente cordialeUNDER LOCK AND KEY: A PROOF SYSTEM FOR A MULTIMODAL LOGICNatural deduction calculi for classical and intuitionistic S5WHAT IS A RULE OF INFERENCE?A Classification of Improper Inference RulesStructural Rules in Natural Deduction with AlternativesCore Type TheoryOn Synonymy in Proof-Theoretic Semantics: The Case of \(\mathtt{2Int}\)Bilateral Rules as Complex RulesHarmony and Normalisation in Bilateral LogicA negative solution to Ono's problem P52: existence and disjunction properties in intermediate predicate logicsDeductive CompletenessUnnamed ItemProof Compression and NP Versus PSPACE IIBOLZANO’S CONCEPT OF GROUNDING (ABFOLGE) AGAINST THE BACKGROUND OF NORMAL PROOFSProof Terms for Generalized Natural DeductionInterpreting descriptions in intensional type theoryPeirce's Rule in a Full Natural Deduction SystemWEAK DISHARMONY: SOME LESSONS FOR PROOF-THEORETIC SEMANTICSLocal Models Semantics, or contextual reasoning = locality + compatibilityE, R AND γUnnamed ItemA phase semantics for polarized linear logic and second order conservativityInvestigations into proof-search in a system of first-order dependent function typesPresenting intuitive deductions via symmetric simplificationUnnamed ItemIntrinsic reasoning about functional programs. I: First order theoriesNormal forms and syntactic completeness proofs for functional independenciesOn the proof theory of Coquand's calculus of constructionsAn expressivist strategy to understand logical formsCanonicity of proofs in constructive modal logicProof-theoretic semantics for intuitionistic multiplicative linear logicThe Cantor–Bernstein theorem: how many proofs?The problem of proof identity, and why computer scientists should care about Hilbert's 24th problemA natural deduction calculus for \textbf{S4.2}Which `intensional paradoxes' are paradoxes?Proof-theoretic semantics: an autobiographical surveyFrege's class theory and the logic of setsThe validity of inference and argumentDisjunctive syllogism without \textit{ex falso}Eight rules for implication eliminationIntensional harmony as isomorphismA new connective in natural deduction, and its application to quantum computingPrawitz, Proofs, and MeaningInferential SemanticsCut Elimination, Substitution and NormalisationInversion Principles and Introduction RulesMeaning in UseOn Constructive Fragments of Classical LogicGeneral-Elimination Harmony and Higher-Level RulesHarmony in Proof-Theoretic Semantics: A Reductive AnalysisParadox and Inconsistency: Revising Tennant’s Distinction Through Schroeder-Heister’s Assumption RulesA Cut-Like Inference in a Framework of Explicit Composition for Various Calculi of Natural DeductionA new connective in natural deduction, and its application to quantum computingUnnamed ItemNormalized natural deduction systems for some relevant logics I: The logic DWCompleteness and Herbrand theorems for nominal logicA Binary Quantifier for Definite Descriptions in Intuitionist Negative Free Logic: Natural Deduction and NormalisationProof-Theoretic Semantics and FeasibilityRelevance Logic as a Conservative Extension of Classical LogicGeneralized Elimination Inferences, Higher-Level Rules, and the Implications-as-Rules Interpretation of the Sequent CalculusRevisiting Zucker’s Work on the Correspondence Between Cut-Elimination and NormalisationOn the Structure of Natural Deduction Derivations for “Generally”Type Theories from Barendregt’s Cube for Theorem ProversAssertions, Hypotheses, Conjectures, Expectations: Rough-Sets Semantics and Proof TheoryAn Approach to General Proof Theory and a Conjecture of a Kind of Completeness of Intuitionistic Logic RevisitedUnnamed ItemTruth and Proof in IntuitionismConstructive Modalities with Provability SmackEmptiness and Discharge in Sequent Calculus and Natural DeductionCUT FOR CLASSICAL CORE LOGICNeo-Logicism and Its LogicIsomorphism of intersection and union typesA note on existential instantiationCATEGORICAL HARMONY AND PATH INDUCTIONTowards a Proof Theory for Heterogeneous Logic Combining Sentences and DiagramsFormal metatheory of the lambda calculus using Stoughton's substitution







This page was built for publication: