Results 131 to 140 of about 255 (160)
Some of the next articles are maybe not open access.
2013
In this paper, we introduce substructural variants of Artemov's logic of proofs. We show a few things here. First, we introduce a bimodal logic that has both the exponential operator in linear logic and an S4 modal operator which does not bring in any structural feature.
Hidenori Kurokawa, Hirohiko Kushida
openaire +1 more source
In this paper, we introduce substructural variants of Artemov's logic of proofs. We show a few things here. First, we introduce a bimodal logic that has both the exponential operator in linear logic and an S4 modal operator which does not bring in any structural feature.
Hidenori Kurokawa, Hirohiko Kushida
openaire +1 more source
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
Synthesized substructural logics
Mathematical Logic Quarterly, 2007AbstractA mechanism for combining any two substructural logics (e.g. linear and intuitionistic logics) is studied from a proof‐theoretic point of view. The main results presented are cut‐elimination and simulation results for these combined logics called synthesized substructural logics. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)
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 +2 more sources
A SAHLQVIST THEOREM FOR SUBSTRUCTURAL LOGIC
The Review of Symbolic Logic, 2013AbstractIn this paper, we establish the first-order definability of sequents with consistent variable occurrence on bi-approximation semantics by means of the Sahlqvist–van Benthem algorithm. Then together with the canonicity results in Suzuki (2011), this allows us to establish a Sahlqvist theorem for substructural logic.
openaire +2 more sources
A Substructural Logic for Inconsistent Mathematics
2019A logic for inconsistent mathematics must be strong enough to support reasoning in proofs, while weak enough to avoid paradoxes. We present a substructural logic intended to meet the needs of a working dialetheic mathematician—specifically, by adding a de Morgan negation to light linear logic, and extending the logic with a relevant conditional.
Badia, Guillermo, Weber, Zach
openaire +4 more sources
Herbrand Theorems for Substructural Logics
2013Herbrand and Skolemization theorems are obtained for a broad family of first-order substructural logics. These logics typically lack equivalent prenex forms, a deduction theorem, and reductions of semantic consequence to satisfiability. The Herbrand and Skolemization theorems therefore take various forms, applying either to the left or right of the ...
Petr Cintula, George Metcalfe
openaire +3 more sources
Substructural logics, pluralism and collapse
Synthese, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Eduardo Alejandro Barrio +2 more
openaire +4 more sources
1993
Abstract Sub structural logics are non classical logics, which arose in response to problems in foundations of mathematics and logic, theoretical computer science, mathematical linguistics, and category theory. They include intuitionistic logic, relevant logic, BCK logic, linear logic, and Lambek's calculus of syntactic categories.
openaire +1 more source
Abstract Sub structural logics are non classical logics, which arose in response to problems in foundations of mathematics and logic, theoretical computer science, mathematical linguistics, and category theory. They include intuitionistic logic, relevant logic, BCK logic, linear logic, and Lambek's calculus of syntactic categories.
openaire +1 more source
Substructural Logics for Pooling Information
2017This paper puts forward a generalization of the account of pooling information – offered by standard epistemic logic – based on intersection of sets of possible worlds. Our account is based on information models for substructural logics and pooling is represented by fusion of information states.
Vít Puncochár, Igor Sedlár
openaire +1 more source