Results 31 to 40 of about 1,704,944 (274)
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 +2 more
doaj +1 more source
First-order logic learning in artificial neural networks [PDF]
, 2010 Artificial Neural Networks have previously been applied in neuro-symbolic learning to learn ground logic program rules. However, there are few results of learning relations using neuro-symbolic learning.
Broda, K., Garcez, A., Guillame-Bert, M.
core +1 more source
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
Finite-Degree Predicates and Two-Variable First-Order Logic [PDF]
, 2015 We consider two-variable first-order logic on finite words with a fixed number of quantifier alternations. We show that all languages with a neutral letter definable using the order and finite-degree predicates are also definable with the order predicate
Paperman, Charles
core +3 more sources
Learning Concepts Definable in First-Order Logic with Counting [PDF]
Logical Methods in Computer ScienceWe 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
A herbrandized functional interpretation of classical first-order logic [PDF]
, 2017 We introduce a new typed combinatory calculus with a type constructor that, to each type σ, associates the star type σ^∗ of the nonempty finite subsets of elements of type σ.
Ferreira, Fernando, Ferreira, Gilda
core +1 more source
A note on the expressive power of linear orders [PDF]
, 2011 This article shows that there exist two particular linear orders such that first-order logic with these two linear orders has the same expressive power as first-order logic with the Bit-predicate FO(Bit). As a corollary we obtain that there also exists a
Anuj Dawar, Kees Doets, Steven Lindell, +8 more
core +2 more sources
One Quantifier Alternation in First-Order Logic with Modular Predicates [PDF]
, 2014 Adding modular predicates yields a generalization of first-order logic FO over words. The expressive power of FO[
Kufleitner, Manfred, Walter, Tobias
core +4 more sources
Explaining the undecidability of first-order logic
Zagadnienia Filozoficzne w NauceTuring 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