Results 151 to 160 of about 481 (175)
When Conditional Logic and Belief Revision Meet Substructural Logics
, 2015 Guillaume Aucher
openalex +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Logic Journal of IGPL, 1994
Summary: Formal systems seem to come in two general kinds: useful and useless. This is painting things starkly, but the point is important. Formal structures can either be used in interesting and important ways, or they can languish unused and irrelevant. Lewis' modal logics are good examples.
openaire +3 more sources
Summary: Formal systems seem to come in two general kinds: useful and useless. This is painting things starkly, but the point is important. Formal structures can either be used in interesting and important ways, or they can languish unused and irrelevant. Lewis' modal logics are good examples.
openaire +3 more sources
Substructural Logical Specifications
2012A logical framework and its implementation should serve as a flexible tool for specifying, simulating, and reasoning about formal systems. When the formal systems we are interested in exhibit state and concurrency, however, existing logical frameworks fall short of this goal.
Frank Pfenning, Robert J. Simmons
openaire +2 more sources
Substructural logics on display
Logic Journal of IGPL, 1998Belnap-style display characterizations admitting cut-elimination are presented for numerous substructural logics including non-commutative intuitionistic linear logic and its relevant, intuitionistic and classical extensions.
openaire +3 more sources
Substructural Logics with Mingle
Journal of Logic, Language and Information, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Skolemization for Substructural Logics
2015The usual Skolemization procedure, which removes strong quantifiers by introducing new function symbols, is in general unsound for first-order substructural logics defined based on classes of complete residuated lattices. However, it is shown here following similar ideas of Baaz and Iemhoff for first-order intermediate logics ini¾?[1] that first-order ...
Cintula, P. (Petr) +2 more
openaire +3 more sources
Modal translations in substructural logics [PDF]
Journal of Philosophical Logic, 1992 The Gödel-Tarski translation of the intuitionistic predicate logic into S4 by prefixing \(\square\) to all subformulas is sound and faithful. The author proves a similar result for translations of the intuitionistic versions of linear logic, relevance logic and BCK-logic into their classical S4-analogs.
openaire +2 more sources
Algebraic Perspectives on Substructural Logics
2021This volume presents the state of the art in the algebraic investigation into substructural logics. It features papers from the workshop AsubL (Algebra & Substructural Logics - Take 6). Held at the University of Cagliari, Italy, this event is part of the framework of the Horizon 2020 Project SYSMICS: SYntax meets Semantics: Methods, Interactions ...
Davide Fazio +2 more
openaire +2 more sources
Tableau Methods for Substructural Logics
1999Over the last few decades a good deal of research in logic has been prompted by the realization that logical systems can be successfully employed to formalize and solve a variety of computational problems. Traditionally, the theoretical framework for most applications was assumed to be classical logic. However, this assumption often turned out to clash
D'AGOSTINO, Marcello +2 more
openaire +3 more sources
Metacompleteness of Substructural Logics
Studia Logica, 2012Metacompleteness is used to prove properties such as the disjunction property and the existence property in the area of relevant logics. On the other hand, the disjunction property of several basic propositional substructural logics over FL has been proved using the cut elimination theorem of sequent calculi and algebraic characterization.
openaire +2 more sources