Results 11 to 20 of about 4,636,755 (203)
Finite-Degree Predicates and Two-Variable First-Order Logic
, 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 only.
Charles Paperman
openalex +7 more sources
A Version of Predicate Logic with Two Variables That has an Incompleteness Property
Studia LogicaAbstract In this paper, we consider predicate logic with two individual variables and general assignment models (where the set of assignments of the variables into a model is allowed to be an arbitrary subset of the usual one). We prove that there is a statement such that no general assignment model in which it is true can be finitely ...
Mohamed Khaled
openalex +3 more sources
Substitutions for predicate variables and functional variables. [PDF]
Notre Dame Journal of Formal Logic, 1980 Hubert H. Schneider
openalex +4 more sources
A Connectionist System for Rule Based Reasoning with Multi-Place Predicates and Variables
, 1989 Abstract : McCarthy has observed that the representational power of most connectionist systems is restricted to unary predicates applied to a fixed object. More recently, Fodor and Pylyshyn have made a sweeping claim the connectionist systems cannot incorporate systematicity and compositionality.
Lokendra Shastri, Venkat Ajjanagadde
openalex +6 more sources
Undecidability of First-Order Modal and Intuitionistic Logics with Two Variables and One Monadic Predicate Letter [PDF]
Studia Logica, 2018 Corrected version of the paper published in Studia Logica, 107(2), 695-717 (2019).
Mikhail Rybakov, Dmitry Shkatov
openalex +5 more sources
Predicate Logic with Sequence Variables and Sequence Function Symbols [PDF]
, 2004 We extend first-order logic with sequence variables and sequence functions. We describe syntax, semantics and inference system for the extension, define an inductive theory with sequence variables and formulate induction rules. The calculus forms a basis for the top-down systematic theory exploration paradigm.
Temur Kutsia, Bruno Buchberger
openalex +3 more sources
Journal of Applied and Industrial Mathematics, 2020 Given a class K of partial Boolean functions and a partial Boolean function f of n variables, a subset U of its variables is called sufficient for the implementation of f in K if there exists an extension of f in K with arguments in U. We consider the problem of recognizing all subsets sufficient for the implementation of f in K.
N. G. Parvatov
openalex +5 more sources
, 2011 Predicate abstraction is a key enabling technology for applying finite-state model checkers to programs written in mainstream languages. It has been used very successfully for debugging sequential system-level C code. Although model checking was originally designed for analyzing concurrent systems, there is little evidence of fruitful applications of ...
Alastair F. Donaldson +3 more
openalex +5 more sources
On predicates expressible in the $1$-function quantifier forms in Kleene Hierarchy with free variables of type $2$ [PDF]
Proceedings of the Japan Academy, Series A, Mathematical Sciences, 1960 Tosiyuki Tugué
openalex +5 more sources
Two-variable first order logic with modular predicates over words
, 2013 We consider first order formulae over the signature consisting of the symbols of the alphabet, the symbol < (interpreted as a linear order) and the set MOD of modular numerical predicates. We study the expressive power of FO^2[
Luc Dartois, Charles Paperman
openalex +5 more sources