Pesca

swMATH13664MaRDI QIDQ25578FDOQ25578

Author name not available (Why is that?)

Official website: http://hackage.haskell.org/package/pesca

Cited In (only showing first 100 items - show all)

• Composition of deductions within the propositions-as-types paradigm
• Noncontractive classical logic
• A more unified approach to free logics
• Axiomatic and dual systems for constructive necessity, a formally verified equivalence
• A cut-free labelled sequent calculus for dynamic epistemic logic
• Free logics are cut-free
• Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 5--11, 2017
• Normality, non-contamination and logical depth in classical natural deduction
• Proof-theoretic analysis of the logics of agency: the deliberative STIT
• Contraction contracted
• Normalisation and subformula property for a system of classical logic with Tarski's rule
• Intuitionistic predicate logic with decidable propositional atoms
• Normal derivability in classical natural deduction
• An investigation into intuitionistic logic with identity
• Admissibility of cut in congruent modal logics
• Full cut elimination and interpolation for intuitionistic logic with existence predicate
• Proof-theoretic harmony: towards an intensional account
• A labelled sequent calculus for BBI: proof theory and proof search
• A conservative negation extension of positive semilattice logic without the finite model property
• Recapturing dynamic logic of relation changers via bounded morphisms
• Sequent-calculi for metainferential logics
• AN ANALYSIS OF THE RULES OF GENTZEN’SNJANDLJ
• Sequent Calculus for Euler Diagrams
• Negation-free and contradiction-free proof of the Steiner-Lehmus theorem
• Modular sequent calculi for classical modal logics
• A proof theoretic view of spatial and temporal dependencies in biochemical systems
• A message-passing interpretation of adjoint logic
• Subatomic negation
• What is the meaning of proofs?. A Fregean distinction in proof-theoretic semantics
• Sequent calculi for \(\mathsf{SCI}\)
• Sequent calculi for semi-De Morgan and De Morgan algebras
• Proof search for propositional abstract separation logics via labelled sequents
• Logic and majority voting
• Metainferential reasoning on strong Kleene models
• Reasoning processes in propositional logic
• Two-sided sequent calculi for \textit{FDE}-like four-valued logics
• Conditional beliefs: from neighbourhood semantics to sequent calculus
• Stoic Sequent Logic and Proof Theory
• Dual erotetic calculi and the minimal \(\mathsf{LFI}\)
• Sequent calculi for intuitionistic Gödel-Löb logic
• Interpolation in extensions of first-order logic
• Reasoning with ambiguity
• The Jacobson radical for an inconsistency predicate
• THE JACOBSON RADICAL OF A PROPOSITIONAL THEORY
• A new connective in natural deduction, and its application to quantum computing
• A new connective in natural deduction, and its application to quantum computing
• Classical harmony and separability
• Equality and Apartness in Bi-intuitinistic Logic
• Fregean Description Theory in Proof-Theoretical Setting
• A simple sequent calculus for Angell's logic of analytic containment
• Free Definite Description Theory – Sequent Calculi and Cut Elimination
• Varieties of linear calculi
• Logicality, double-line rules, and modalities
• Verificationism and Classical Realizability
• Cut elimination for entailment relations
• Cut elimination, substitution and normalisation
• A survey of nonstandard sequent calculi
• Towards a non-classical meta-theory for substructural approaches to paradox
• On paradoxes in normal form
• Maximum segments as natural deduction images of some cuts
• Cut elimination and normalization for generalized single and multi-conclusion sequent and natural deduction calculi
• Machine-checked proof-theory for propositional modal logics
• PROOF-THEORETIC ANALYSIS OF THE QUANTIFIED ARGUMENT CALCULUS
• Title not available (Why is that?)
• Functional Completeness in CPL via Correspondence Analysis
• Normal proofs, cut free derivations and structural rules
• A rewriting logic approach to specification, proof-search, and meta-proofs in sequent systems
• Leśniewski's ontology -- proof-theoretic characterization
• Reasoning about truth in first-order logic
• Sequent systems for nondeterministic propositional logics without reflexivity
• Incomplete symbols -- definite descriptions revisited
• Paradox and logical revision. A short introduction
• Yet another bijection between sequent calculus and natural deduction
• A dual-context sequent calculus for the constructive modal logic S4
• Tableaux and dual tableaux: transformation of proofs
• A framework for proof systems
• Classical propositional logic and decidability of variables in intuitionistic propositional logic
• LINEAR TIME IN HYPERSEQUENT FRAMEWORK
• Proof theory for functional modal logic
• General-elimination harmony and the meaning of the logical constants
• Combinatorial analysis of proofs in projective and affine geometry
• Admissibility of cut in LC with fixed point combinator
• Glivenko sequent classes in the light of structural proof theory
• Socratic proofs
• On multiple conclusion deductions in classical logic
• General-elimination harmony and higher-level rules
• Decision methods for linearly ordered Heyting algebras
• Inversion principles and introduction rules
• Meaning in use
• A loop-free decision procedure for modal propositional logics K4, S4 and S5
• Principles for object-linguistic consequence: from logical to irreflexive
• On all strong Kleene generalizations of classical logic
• Analytic rules for mereology
• Cut-elimination and quantification in canonical systems
• Proof systems for various \textsf{FDE}-based modal logics
• Judgement aggregation in non-classical logics
• The Church-Fitch knowability paradox in the light of structural proof theory
• Corrected upper bounds for free-cut elimination
• Generalized Galois logics. Relational semantics of nonclassical logical calculi
• Axiomatizing geometric constructions

This page was built for software: Pesca