Results 31 to 40 of about 16,441 (253)

Ordered fragments of first-order logic

CoRR, 2021
<p>Using a recently introduced algebraic framework for classifying fragments of first-order logic, we study the complexity of the satisfiability problem for several ordered fragments of first-order logic, which are obtained from the ordered logic and the fluted logic by modifying some of their syntactical restrictions. </p>
openaire   +5 more sources

From formulas to cirquents in computability logic [PDF]

Logical Methods in Computer Science, 2011
Computability logic (CoL) (see http://www.cis.upenn.edu/~giorgi/cl.html) is a recently introduced semantical platform and ambitious program for redeveloping logic as a formal theory of computability, as opposed to the formal theory of truth that logic ...
Giorgi Japaridze
doaj   +1 more source

One-Sided Sequent Systems for Nonassociative Bilinear Logic: Cut Elimination and Complexity

Bulletin of the Section of Logic, 2021
Bilinear Logic of Lambek amounts to Noncommutative MALL of Abrusci. Lambek proves the cut–elimination theorem for a one-sided (in fact, left-sided) sequent system for this logic.
Paweł Płaczek
doaj   +1 more source

Fragmenting modal logic

Inquiry
Fragmentalism allows incompatible facts to constitute reality in an absolute manner, provided that they fail to obtain together. In recent years, the view has been extensively discussed, with a focus on its formalisation in modeltheoretic terms. This paper focuses on three formalisations: Lipman’s approach, the subvaluationist interpretation, and a ...
Samuele Iaquinto, Ciro De Florio, Aldo Frigerio   +2 more
openaire   +4 more sources

Covering and separation for logical fragments with modular predicates [PDF]

Logical Methods in Computer Science, 2019
For every class $\mathscr{C}$ of word languages, one may associate a decision problem called $\mathscr{C}$-separation. Given two regular languages, it asks whether there exists a third language in $\mathscr{C}$ containing the first language, while being ...
Thomas Place, Varun Ramanathan, Pascal Weil   +2 more
doaj   +1 more source

Computations in fragments of intuitionistic propositional logic [PDF]

Journal of Automated Reasoning, 1991
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jongh, D. de, Hendriks, L., Renardel de Lavalette, G.R.   +2 more
openaire   +4 more sources

Maximum Entropy Reasoning via Model Counting in (Description) Logics that Count

Proceedings of the International Florida Artificial Intelligence Research Society Conference
In previous work it was shown that the logic ALCME,  which extends the description logic (DL) ALC with probabilistic conditionals, has domain-lifted inference.
Franz Baader, Anton Claußnitzer
doaj   +1 more source

Unary negation [PDF]

Logical Methods in Computer Science, 2013
We study fragments of first-order logic and of least fixed point logic that allow only unary negation: negation of formulas with at most one free variable.
Luc Segoufin, Balder ten Cate
doaj   +1 more source

Adding Path-Functional Dependencies to the Guarded Two-Variable Fragment with Counting [PDF]

Logical Methods in Computer Science, 2017
The satisfiability and finite satisfiability problems for the two-variable guarded fragment of first-order logic with counting quantifiers, a database, and path-functional dependencies are both ExpTime-complete.
Georgios Kourtis, Ian Pratt-Hartmann
doaj   +1 more source

A Variant of Material Connexive Logic

Bulletin of the Section of Logic, 2021
The relationship between formal (standard) logic and informal (common-sense, everyday) reasoning has always been a hot topic. In this paper, we propose another possible way to bring it up inspired by connexive logic.
Alexander Belikov, Dmitry Zaitsev
doaj   +1 more source