Simple consequence relations

DOI10.1016/0890-5401(91)90023-UzbMATH Open0733.03007OpenAlexW2178257282MaRDI QIDQ809992FDOQ809992

Authors: Arnon Avron 

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

Recommendations

• scientific article; zbMATH DE number 3916222
• Publication:4942674
• scientific article; zbMATH DE number 218517
• Intelim rules for classical connectives
• On the computational representation of classical logical connectives

zbMATH Keywords

linear logiclogical connectivesmultiple sequent calculi

Mathematics Subject Classification ID

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

Cites Work

• The semantics and proof theory of linear logic
• Display logic
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Semantical investigations in Heyting's intuitionistic logic
• Title not available (Why is that?)
• Proof theory
• A logic covering undefinedness in program proofs
• What is Logic?
• Title not available (Why is that?)
• A natural extension of natural deduction
• Title not available (Why is that?)
• Relevant entailment—semantics and formal systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A constructive analysis of RM
• On an implication connective of RM
• Title not available (Why is that?)
• Gentzenizing Schroeder-Heister's natural extension of natural deduction
• Rules and Derived Rules
• Title not available (Why is that?)
• Sequent-systems for modal logic

Cited In (60)

• A practical implementation of simple consequence relations using inductive definitions
• The expressive power of Structural Operational Semantics with explicit assumptions
• Consequence-inconsistency interrelation: in the framework of paraconsistent logics
• Relevant consequence relations: an invitation
• A family of metainferential logics
• Gentzen-type systems, resolution and tableaux
• Set-theoretical and other elementary models of the \(\lambda\)-calculus
• Theo: An interactive proof development system
• Logical consequence and the paradoxes
• Does the implication elimination rule need a minor premise?
• Proof theory of paraconsistent weak Kleene logic
• Inferences and metainferences in \(\mathsf{ST}\)
• On extensibility of proof checkers
• Consequence relations and admissible rules
• The semantics and proof theory of linear logic
• The proof monad
• Nonmonotonic reasoning, preferential models and cumulative logics
• Logical systems for structured specifications.
• A generalization of analytic deduction via labelled deductive systems. I: Basic substructural logics
• A Critical Overview of the Most Recent Logics of Grounding
• Combining classical logic, paraconsistency and relevance
• A natural deduction approach to dynamic logic
• Cut-elimination and quantification in canonical systems
• What is a paraconsistent logic?
• ST, LP and tolerant metainferences
• Anti-intuitionism and paraconsistency
• A fully classical truth theory characterized by substructural means
• Basing sequent systems on exclusive-or
• Naive truth and naive logical properties
• On negation: Pure local rules
• Title not available (Why is that?)
• Metainferences from a proof-theoretic perspective, and a hierarchy of validity predicates
• A note on contraction-free logic for validity
• Relevant connexive logic
• On the formalization of the modal \(\mu\)-calculus in the calculus of inductive constructions
• Multi-valued semantics: why and how
• THE JACOBSON RADICAL OF A PROPOSITIONAL THEORY
• Hopeful monsters: a note on multiple conclusions
• Equivalences between logics and their representing type theories
• What is an inference rule?
• Strict canonical constructive systems
• What is a logic translation?
• An abstract approach to consequence relations
• A defeasible reasoning model of inductive concept learning from examples and communication
• Logicality, double-line rules, and modalities
• Tutorial on admissible rules in Gudauri
• Reasoning with different levels of uncertainty
• Axiomatizing non-deterministic many-valued generalized consequence relations
• Disjoint logics
• A simple logical matrix and sequent calculus for Parry's logic of analytic implication
• What is the logic of inference?
• Structured theory presentations and logic representations
• A survey of nonstandard sequent calculi
• Does the deduction theorem fail for modal logic?
• Eliminating disjunctions by disjunction elimination
• Eliminating disjunctions by disjunction elimination
• Proof-search in type-theoretic languages: An introduction
• Using typed lambda calculus to implement formal systems on a machine
• The original sin of proof-theoretic semantics
• Structural weakening and paradoxes

This page was built for publication: Simple consequence relations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q809992)