Results 51 to 60 of about 200,339 (137)
On algorithmic expressivity of finite-variable fragments of intuitionistic modal logics [PDF]
arXiv, 2023 We obtain poly-time embeddings of the intuitionistic modal logics FS and MIPC into their positive one-variable fragments.
arxiv
MK-fuzzy Automata and MSO Logics [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 We introduce MK-fuzzy automata over a bimonoid K which is related to the fuzzification of the McCarthy-Kleene logic. Our automata are inspired by, and intend to contribute to, practical applications being in development in a project on runtime network ...
Manfred Droste +3 more
doaj +1 more source
Proof Normalisation in a Logic Identifying Isomorphic Propositions [PDF]
, 2019 We define a fragment of propositional logic where isomorphic propositions, such as $A\land B$ and $B\land A$, or $A\Rightarrow (B\land C)$ and $(A\Rightarrow B)\land(A\Rightarrow C)$ are identified.
Dowek, Gilles, Díaz-Caro, Alejandro
core +4 more sources
Quantum Uncertainties and Holism Seem to Render Irrelevant Qudit-Semantics
Entropy, 2021 We consider a semantics based on the peculiar holistic features of the quantum formalism. Any formula of the language gives rise to a quantum circuit that transforms the density operator associated to the formula into the density operator associated to ...
Roberto Leporini
doaj +1 more source
On Sub-Propositional Fragments of Modal Logic [PDF]
Logical Methods in Computer Science, Volume 14, Issue 2 (June 22,
2018) lmcs:2550, 2016 In this paper, we consider the well-known modal logics $\mathbf{K}$, $\mathbf{T}$, $\mathbf{K4}$, and $\mathbf{S4}$, and we study some of their sub-propositional fragments, namely the classical Horn fragment, the Krom fragment, the so-called core fragment, defined as the intersection of the Horn and the Krom fragments, plus their sub-fragments obtained
arxiv +1 more source
On decidability of a fragment of intuitionistic predicate logic
Lietuvos Matematikos Rinkinys, 1999 There is not abstract.
Jolanta Kaušilaitė +1 more
doaj +1 more source
A Logic for Choreographies [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 We explore logical reasoning for the global calculus, a coordination model based on the notion of choreography, with the aim to provide a methodology for specification and verification of structured communications.
Marco Carbone +3 more
doaj +1 more source
From truth to computability I [PDF]
, 2005 The recently initiated approach called computability logic is a formal theory of interactive computation. See a comprehensive online source on the subject at http://www.cis.upenn.edu/~giorgi/cl.html .
Abramsky +13 more
core +2 more sources
Step-Indexed Normalization for a Language with General Recursion [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 The Trellys project has produced several designs for practical dependently typed languages. These languages are broken into two fragments—a _logical_ fragment where every term normalizes and which is consistent when interpreted as a logic, and a ...
Chris Casinghino +2 more
doaj +1 more source
Bulletin of the Section of Logic, 2021 We examine the set of formula-to-formula valid inferences of Classical Logic, where the premise and the conclusion share at least a propositional variable in common. We review the fact, already proved in the literature, that such a system is identical to
Damian E. Szmuc
doaj +1 more source