Results 21 to 30 of about 132,970 (251)

First-order logical duality

Annals of Pure and Applied Logic, 2013
From a logical point of view, Stone duality for Boolean algebras relates theories in classical propositional logic and their collections of models. The theories can be seen as presentations of Boolean algebras, and the collections of models can be topologized in such a way that the theory can be recovered from its space of models.
Awodey, Steve, Forssell, Henrik
openaire   +2 more sources

Finite Model Reasoning in Expressive Fragments of First-Order Logic [PDF]

Electronic Proceedings in Theoretical Computer Science, 2017
Over the past two decades several fragments of first-order logic have been identified and shown to have good computational and algorithmic properties, to a great extent as a result of appropriately describing the image of the standard translation of ...
Lidia Tendera
doaj   +1 more source

Logic + probabilistic programming + causal laws

Royal Society Open Science, 2023
Probabilistic planning attempts to incorporate stochastic models directly into the planning process, which is the problem of synthesizing a sequence of actions that achieves some objective for a putative agent.
Vaishak Belle
doaj   +1 more source

First-order Gödel logics

Annals of Pure and Applied Logic, 2007
First-order Goedel logics are a family of infinite-valued logics where the sets of truth values V are closed subsets of [0, 1] containing both 0 and 1. Different such sets V in general determine different Goedel logics G_V (sets of those formulas which evaluate to 1 in every interpretation into V). It is shown that G_V is axiomatizable iff V is finite,
Baaz, Matthias, Preining, Norbert, Zach, Richard   +2 more
openaire   +2 more sources

Completeness classes for intuitionistic first-order temporal logic with time gaps

Lietuvos Matematikos Rinkinys, 2023
There is not abstract.
Romas Alonderis
doaj   +3 more sources

Admissibility, compatibility, and deducibility in first-order sequent logics [PDF]

Computer Science Journal of Moldova, 2015
The paper is about the notions of admissibility and compatibility and their significance for deducibility in different sequent logics including first-order classical and intuitionistic ones both without and with equality and, possibly, with modal rules.
Alexander Lyaletski
doaj  

Inferences Between Buridan’s Modal Propositions

Problemos, 2022
In recent years modal syllogistic provided by 14th century logician John Buridan has attracted increasing attention of historians of medieval logic. The widespread use of quantified modal logic with the apparatus of possible worlds semantics in current ...
Jonas Dagys, Haroldas Giedra, Živilė Pabijutaitė   +2 more
doaj   +1 more source

Learning Concepts Definable in First-Order Logic with Counting [PDF]

Logical Methods in Computer Science
We study Boolean classification problems over relational background structures in the logical framework introduced by Grohe and Turán (TOCS 2004). It is known (Grohe and Ritzert, LICS 2017) that classifiers definable in first-order logic over structures ...
Steffen van Bergerem
doaj   +1 more source

Explaining the undecidability of first-order logic

Zagadnienia Filozoficzne w Nauce
Turing proved the unsolvability of the decision problem for first-order logic (Entscheidungsproblem) in his famous paper On Computable Numbers, with an Application to the Entscheidungsproblem.
Timm Lampert, Anderson Nakano
doaj   +1 more source

First order logic to set requirements for secure code execution

Труды Института системного программирования РАН, 2018
Currently the problem of information security during designing and exploiting the objects of critical information infrastructure is paid special attention to.
A. V. Kozachok
doaj   +1 more source