Results 21 to 30 of about 2,597 (173)

Coalgebraic completeness-via-canonicity for distributive substructural logics [PDF]

open access: yes, 2016
We prove strong completeness of a range of substructural logics with respect to a natural poset-based relational semantics using a coalgebraic version of completeness-via-canonicity.
Dahlqvist, Fredrik, Pym, David
core   +2 more sources

Substructural fuzzy logics

open access: yesJournal of Symbolic Logic, 2007
AbstractSubstructural fuzzy logics are substructural logics that are complete with respect to algebras whose lattice reduct is the real unit interval [0, 1]. In this paper, we introduce Uninorm logicULas Multiplicative additive intuitionistic linear logicMAILLextended with the prelinearity axiom((A → B) ∧ t) V ((B → A)∧ t).
Metcalfe G., Montagna F.
openaire   +4 more sources

Quantitative Equality in Substructural Logic via Lipschitz Doctrines [PDF]

open access: yesLogical Methods in Computer Science
Substructural logics naturally support a quantitative interpretation of formulas, as they are seen as consumable resources. Distances are the quantitative counterpart of equivalence relations: they measure how much two objects are similar, rather than ...
Francesco Dagnino, Fabio Pasquali
doaj   +1 more source

Dynamic Separation Logic and its Use in Education

open access: yesСовременные информационные технологии и IT-образование, 2020
Mathematical logic is widely used in hardware and software verification. Hoare logic is particularly suitable for reasoning about imperative programs.
Evgeny Makarov
doaj   +1 more source

Weak consistency and strong paraconsistency

open access: yestripleC: Communication, Capitalism & Critique, 2009
In a standard sense, consistency and paraconsistency are understood as, respectively, the absence of any contradiction and as the absence of the ECQ (“E contradictione quodlibet”) rule that allows us to conclude any well formed formula from any ...
Gemma Robles
doaj   +1 more source

Basic Logic and Quantum Entanglement [PDF]

open access: yes, 2006
As it is well known, quantum entanglement is one of the most important features of quantum computing, as it leads to massive quantum parallelism, hence to exponential computational speed-up.
Battilotti G   +7 more
core   +2 more sources

Inconsistency, paraconsistency and ω-inconsistency [PDF]

open access: yes, 2018
In this paper I'll explore the relation between ω-inconsistency and plain inconsistency, in the context of theories that intend to capture semantic concepts. In particular, I'll focus on two very well known inconsistent but non-trivial theories of truth:
Da Re, Bruno
core   +2 more sources

Classical BI: Its Semantics and Proof Theory [PDF]

open access: yes, 2009
We present Classical BI (CBI), a new addition to the family of bunched logics which originates in O'Hearn and Pym's logic of bunched implications BI.
Alasdair Urquhart   +17 more
core   +5 more sources

Logics for modelling collective attitudes [PDF]

open access: yes, 2017
We introduce a number of logics to reason about collective propositional attitudes that are defined by means of the majority rule. It is well known that majoritarian aggregation is subject to irrationality, as the results in social ...
Porello, Daniele
core   +2 more sources

A Van Benthem Characterization Result for Distribution-Free Logics

open access: yesLogics
This article contributes to recent results in the model theory of distribution-free logics (which include a Goldblatt-Thomason theorem and a development of their Sahlqvist theory) by lifting van Benthem’s characterization result for modal logic to the ...
Chrysafis Hartonas
doaj   +1 more source

Home - About - Disclaimer - Privacy