Results 61 to 70 of about 87,429 (211)

Methods for Solving Necessary Equivalences [PDF]

, 2004
Nonmonotonic Logics such as Autoepistemic Logic, Reflective Logic, and Default Logic, are usually defined in terms of set-theoretic fixed-point equations defined over deductively closed sets of sentences of First Order Logic.
Brown, Frank
core  

Does Treewidth Help in Modal Satisfiability?

, 2010
Many tractable algorithms for solving the Constraint Satisfaction Problem (CSP) have been developed using the notion of the treewidth of some graph derived from the input CSP instance.
A. Herzig, B. Cate ten, B. Courcelle, E. Fischer, G. Pan, G. Pan, H. Chen, H.L. Bodlaender, H.L. Bodlaender, I. Adler, J. Flum, J.H. Reif, J.Y. Halpern, J.Y. Halpern, M. Fellows, M. Grohe, M. Samer, M.Y. Vardi, P. Blackburn, P. Enjalbert, R. Fagin, R.E. Ladner, V. Dalmau, V.R. Pratt, Y. Kazakov   +24 more
core   +1 more source

A Syntactic Proof of the Decidability of First-Order Monadic Logic

Bulletin of the Section of Logic
Decidability of monadic first-order classical logic was established by Löwenheim in 1915. The proof made use of a semantic argument and a purely syntactic proof has never been provided.
Eugenio Orlandelli, Matteo Tesi
doaj   +1 more source

Reflexive insensitive modal logics [PDF]

, 2015
We analyze a class of modal logics rendered insensitive to reflexivity by way of a modification to the semantic definition of the modal operator. We explore the extent to which these logics can be characterized, and prove a general completeness theorem ...
Gilbert, David, Venturi, Giorgio
core   +2 more sources

Lewis meets Brouwer: constructive strict implication

, 2017
C. I. Lewis invented modern modal logic as a theory of "strict implication". Over the classical propositional calculus one can as well work with the unary box connective.
Litak, Tadeusz, Visser, Albert
core   +1 more source

FIVE STEPS TO RESPONSIBILITY - DOI: 10.12818/P.0304-2340.2013v63p125

Revista da Faculdade de Direito da Universidade Federal de Minas Gerais, 2014
Responsibility has entered the academic discourse of logicians hardly more than few decades ago. I suggest a logical concept of responsibility which employs ideas both from a number of theories belonging to different branches of logic as well from other
Elena Lisanyuk
doaj   +4 more sources

A Comparison of Implications in Orthomodular Quantum Logic—Morphological Analysis of Quantum Logic

International Journal of Mathematics and Mathematical Sciences, 2012
Morphological operators are generalized to lattices as adjunction pairs (Serra, 1984; Ronse, 1990; Heijmans and Ronse, 1990; Heijmans, 1994). In particular, morphology for set lattices is applied to analyze logics through Kripke semantics (Bloch, 2002 ...
Mitsuhiko Fujio
doaj   +1 more source

A modal logic internalizing normal proofs

Information and Computation, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Park, S, Im, H
openaire   +3 more sources

Reasoning in Non-normal Modal Description Logics

, 2022
Non-normal modal logics, interpreted on neighbourhood models which generalise the usual relational semantics, have found application in several areas, such as epistemic, deontic, and coalitional reasoning. We present here preliminary results on reasoning in a family of modal description logics obtained by combining ALC with non-normal modal operators ...
Dalmonte, Tiziano, Mazzullo, Andrea, Ozaki, Ana   +2 more
openaire   +2 more sources

A Modal Logic for Termgraph Rewriting

, 2010
We propose a modal logic tailored to describe graph transformations and discuss some of its properties. We focus on a particular class of graphs called termgraphs. They are first-order terms augmented with sharing and cycles.
Balbiani, Ph., Echahed, R., Herzig, A.
core   +3 more sources