Simple consequence relations

DOI10.1016/0890-5401(91)90023-UzbMath0733.03007OpenAlexW2178257282MaRDI QIDQ809992

Publication date: 1991

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0890-5401(91)90023-u

zbMATH Keywords

linear logic logical connectives multiple sequent calculi

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Abstract deductive systems (03B22)

Related Items

Structured theory presentations and logic representations, Inferences and metainferences in \(\mathsf{ST}\), Consequence relations and admissible rules, A generalization of analytic deduction via labelled deductive systems. I: Basic substructural logics, Logicality, double-line rules, and modalities, Basing sequent systems on exclusive-or, Tutorial on Admissible Rules in Gudauri, The semantics and proof theory of linear logic, A defeasible reasoning model of inductive concept learning from examples and communication, THE JACOBSON RADICAL OF A PROPOSITIONAL THEORY, NAIVE TRUTH AND NAIVE LOGICAL PROPERTIES, Does the deduction theorem fail for modal logic?, What is a logic translation?, On extensibility of proof checkers, Eliminating disjunctions by disjunction elimination, Metainferences from a proof-theoretic perspective, and a hierarchy of validity predicates, What is an inference rule?, The expressive power of Structural Operational Semantics with explicit assumptions, Axiomatizing non-deterministic many-valued generalized consequence relations, A FULLY CLASSICAL TRUTH THEORY CHARACTERIZED BY SUBSTRUCTURAL MEANS, Proof theory of paraconsistent weak Kleene logic, What is the logic of inference?, Equivalences between logics and their representing type theories, The original sin of proof-theoretic semantics, ELIMINATING DISJUNCTIONS BY DISJUNCTION ELIMINATION, A note on contraction-free logic for validity, AN ABSTRACT APPROACH TO CONSEQUENCE RELATIONS, Nonmonotonic reasoning, preferential models and cumulative logics, A Critical Overview of the Most Recent Logics of Grounding, Logical consequence and the paradoxes, What is a Paraconsistent Logic?, ST, LP and Tolerant Metainferences, Structural weakening and paradoxes, A simple logical matrix and sequent calculus for Parry's logic of analytic implication, A natural deduction approach to dynamic logic, Using typed lambda calculus to implement formal systems on a machine, Theo: An interactive proof development system, A survey of nonstandard sequent calculi, A family of metainferential logics, Strict Canonical Constructive Systems, The proof monad, Combining classical logic, paraconsistency and relevance, Anti-intuitionism and paraconsistency, On negation: Pure local rules, Hopeful monsters: a note on multiple conclusions, Relevant Connexive Logic, Reasoning with different levels of uncertainty, A practical implementation of simple consequence relations using inductive definitions, Multi-valued semantics: why and how, Consequence–Inconsistency Interrelation: In the Framework of Paraconsistent Logics, Proof-search in type-theoretic languages: An introduction, Does the Implication Elimination Rule Need a Minor Premise?, Logical systems for structured specifications., On the formalization of the modal \(\mu\)-calculus in the calculus of inductive constructions, Disjoint Logics, Gentzen-type systems, resolution and tableaux, Set-theoretical and other elementary models of the \(\lambda\)-calculus, Cut-elimination and quantification in canonical systems

Cites Work