Results 71 to 80 of about 2,597 (173)

Constructive Logic with Strong Negation is a Substructural Logic. II [PDF]

, 2018
The goal of this two-part series of papers is to show that constructive logic with strong negation N is definitionally equivalent to a certain axiomatic extension NFL ew of the substructural logic FL ew .
Spinks, M., Veroff, R.
core  

25th Workshop on Logic, Language, Information and Computation: WoLLIC 2018. [PDF]

J Logic Lang Inf, 2022
Moss L, de Queiroz R.
europepmc   +1 more source

Connexive implications in Substructural Logics [PDF]

, 2022
Davide Fazio, Gavin St. John
openalex   +1 more source

Logics and admissible rules of constructive set theories. [PDF]

Philos Trans A Math Phys Eng Sci, 2023
Iemhoff R, Passmann R.
europepmc   +1 more source

A Logical Modeling of Severe Ignorance. [PDF]

J Philos Logic, 2023
Bonzio S, Fano V, Graziani P, Pra Baldi M.   +3 more
europepmc   +1 more source

Implication in finite posets with pseudocomplemented sections. [PDF]

Soft comput, 2022
Chajda I, Länger H.
europepmc   +1 more source

Higher-order representation of substructural logics [PDF]

ACM SIGPLAN Notices, 2010
We present a technique for higher-order representation of substructural logics such as linear or modal logic. We show that such logics can be encoded in the (ordinary) Logical Framework, without any linear or modal extensions. Using this encoding, metatheoretic proofs about such logics can easily be developed in the Twelf proof assistant.
openaire   +1 more source

Sheffer operation in relational systems. [PDF]

Soft comput, 2022
Chajda I, Länger H.
europepmc   +1 more source

A Substructural Epistemic Resource Logic: Theory and Modelling\n Applications [PDF]

, 2019
Didier Galmiche, Pierre Kimmel, David Pym   +2 more
openalex   +1 more source

Characterizing logic grammars: A substructural logic approach

The Journal of Logic Programming, 1996
Summary: A characterization of static discontinuity grammars (SDGs), a logic grammar formalism due to Dahl, is given in this paper. A substructural logic sequent calculus proof system is given which is shown to be equivalent to SDGs for parsing problems in the sense that a string of terminal symbols is accepted by a grammar if and only if the ...
Andrews, James, Dahl, Veronica, Popowich, Fred   +2 more
openaire   +1 more source