Pesca

swMATH13664MaRDI QIDQ25578FDOQ25578

Author name not available (Why is that?)

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

• Incomplete symbols -- definite descriptions revisited
• Paradox and logical revision. A short introduction
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• 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
• Correspondence between Modal Hilbert Axioms and Sequent Rules with an Application to S5
• Constructing Cut Free Sequent Systems with Context Restrictions Based on Classical or Intuitionistic Logic
• Sequent Systems for Nondeterministic Propositional Logics without Reflexivity
• Decision methods for linearly ordered Heyting algebras
• 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
• Judgement aggregation in non-classical logics
• Sequent-calculi for metainferential logics
• The Church-Fitch knowability paradox in the light of structural proof theory
• Corrected upper bounds for free-cut elimination
• Axiomatizing geometric constructions
• Forms of the Pasch axiom in ordered geometry
• Validity concepts in proof-theoretic semantics
• The \(\lambda \)-calculus and the unity of structural proof theory
• Proof analysis in modal logic
• Uniform interpolation and propositional quantifiers in modal logics
• Modular sequent calculi for classical modal logics
• The normalization theorem for extended natural deduction
• \(LE^{t}_{ \to }, LR^{ \circ }_{\widehat{\sim}}, LK\) and cutfree proofs
• Title not available (Why is that?)
• Metainferential reasoning on strong Kleene models
• Proofs and countermodels in non-classical logics
• Structural proof theory. With an appendix by Aarne Ranta
• Revising a Labelled Sequent Calculus for Public Announcement Logic
• Reasoning about collectively accepted group beliefs
• Proof analysis in intermediate logics
• PROOF SYSTEMS FOR VARIOUS FDE-BASED MODAL LOGICS
• Hypersequent calculi for intuitionistic logic with classical atoms
• Eliminability of cut in hypersequent calculi for some modal logics of linear frames
• Constructibility and Geometry
• The bounded proof property via step algebras and step frames
• Proof theory for reasoning with Euler diagrams: a logic translation and normalization
• Sufficient conditions for cut elimination with complexity analysis
• Proof theory of Nelson's paraconsistent logic: a uniform perspective
• Correspondence analysis for some fragments of classical propositional logic
• Title not available (Why is that?)
• Proof Theory for Distributed Knowledge
• Foundations of Software Science and Computational Structures
• General-Elimination Harmony and Higher-Level Rules
• Generalized Elimination Inferences, Higher-Level Rules, and the Implications-as-Rules Interpretation of the Sequent Calculus
• A normalizing system of natural deduction for intuitionistic linear logic
• Restricting Initial Sequents: The Trade-Offs Between Identity, Contraction and Cut
• A proof-search procedure for intuitionistic propositional logic
• Does the deduction theorem fail for modal logic?
• Socratic trees
• Permutability of rules in lattice theory.
• Title not available (Why is that?)
• On harmony and permuting conversions
• Inversion Principles and Introduction Rules
• Meaning in Use
• General-elimination stability
• Implications-as-rules vs. implications-as-links: an alternative implication-left schema for the sequent calculus
• Ultimate Normal Forms for Parallelized Natural Deductions
• From QBFs to \textsf{MALL} and back via focussing
• Eight inference rules for implication
• Title not available (Why is that?)
• Deriving Natural Deduction Rules from Truth Tables
• CALCULIZING CLASSICAL INFERENTIAL EROTETIC LOGIC
• Prawitz, Proofs, and Meaning
• Proof theory for heterogeneous logic combining formulas and diagrams: proof normalization
• Open Reading and Free Choice Permission: A Perspective in Substructural Logics
• THE ELIMINATION OF ATOMIC CUTS AND THE SEMISHORTENING PROPERTY FOR GENTZEN’S SEQUENT CALCULUS WITH EQUALITY
• Does the Implication Elimination Rule Need a Minor Premise?
• Dialogues and Proofs; Yankov’s Contribution to Proof Theory
• Translations between Gentzen-Prawitz and Jaśkowski-Fitch natural deduction proofs
• Logical Nihilism and the Logic of ‘prem’
• INVERSION BY DEFINITIONAL REFLECTION AND THE ADMISSIBILITY OF LOGICAL RULES
• Complete independence of an axiom system for central translations
• Hypersequent Calculus for Intuitionistic Logic with Classical Atoms
• Stanisław Jaśkowski and Natural Deduction Systems
• From mathematical axioms to mathematical rules of proof: recent developments in proof analysis
• Constructive Embedding from Extensions of Logics of Strict Implication into Modal Logics
• Introspection, Normality and Agglomeration
• Title not available (Why is that?)
• Higher-level inferences in the strong-Kleene setting: a proof-theoretic approach
• FRACTIONAL SEMANTICS FOR CLASSICAL LOGIC
• Essential structure of proofs as a measure of complexity
• The intensional side of algebraic-topological representation theorems
• Tautology Elimination, Cut Elimination, and S5
• PRIORITY MERGE AND INTERSECTION MODALITIES
• The Rule of Existential Generalisation and Explicit Substitution

This page was built for software: Pesca