Pesca

swMATH13664MaRDI QIDQ25578FDOQ25578

Author name not available (Why is that?)

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

• 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
• Admissibility of cut in congruent modal logics
• 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
• Sequent-calculi for metainferential 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
• 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?)
• Proof theory of epistemic logic of programs
• Metainferential reasoning on strong Kleene models
• Proofs and countermodels in non-classical logics
• Structural proof theory. With an appendix by Aarne Ranta
• Reasoning about collectively accepted group beliefs
• Proof analysis in intermediate 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
• Proof Theory for Distributed Knowledge
• Foundations of Software Science and Computational Structures
• 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.
• On harmony and permuting conversions
• 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
• 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
• Revising a labelled sequent calculus for public announcement logic
• 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
• 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
• Proof analysis of Peirce's alpha system of graphs
• AN ANALYSIS OF THE RULES OF GENTZEN’SNJANDLJ
• Sequent calculi for the propositional logic of HYPE
• Sequent Calculus for Euler Diagrams
• Negation-free and contradiction-free proof of the Steiner-Lehmus theorem
• A proof theoretic view of spatial and temporal dependencies in biochemical systems
• Lyndon interpolation theorem of instantial neighborhood logic-constructively via a sequent calculus
• A message-passing interpretation of adjoint logic
• Subatomic negation

This page was built for software: Pesca