Results 21 to 30 of about 970 (166)
The undecidability of proof search when equality is a logical connective [PDF]
, 2021 International audienceOne proof-theoretic approach to equality in quantificational logic treats equality as a logical connective: in particular, term equality can be given both leftand right introduction rules in a sequent calculus proof system.
Viel, Alexandre, Miller, Dale
core +1 more source
Parameterized Complexity of Equality MinCSP [PDF]
, 2023 We study the parameterized complexity of MinCSP for so-called equality languages, i.e., for finite languages over an infinite domain such as ℕ, where the relations are defined via first-order formulas whose only predicate is =. This is an important class
Wahlström, Magnus, Osipov, George
core +4 more sources
Eager Equality for Rational Number Arithmetic [PDF]
, 2023 Eager equality for algebraic expressions over partial algebras distinguishes or separates terms only if both have defined values and they are different. We consider arithmetical algebras with division as a partial oper- ator, called meadows, and focus on
John Tucker
core +1 more source
Известия Иркутского государственного университета: Серия "Математика", 2019 Multioperations are operations from a finite set A to set of all subsets of A. The usual composition operator leads to a continuum of closed sets. Therefore, the research of closure operators, which contain composition and other operations becomes ...
V.I. Panteleev, L. Riabets
doaj +1 more source
Monodic Epistemic Predicate Logic [PDF]
, 2000 We consider the monodic formulas of common knowledge predicate logic, which allow applications of epistemic operators to formulas with at most one free variable.
Sturm, H +8 more
core +1 more source
Algorithmic complexity of monadic multimodal predicate logics with equality over finite Kripke frames [PDF]
, 2023 The paper investigates algorithmic complexity of monadic multimodal predicate logics with equality over finite Kripke frames or classes of finite Kripke frames.
Rybakov, M. +2 more
core +1 more source
Generic Equality and Comparison for Common Lisp [PDF]
, 2021 Several Common Lisp functions rely on the :test keyword to pass a predicate to be used in their operations. This is a satisfactory solution in most cases, yet, while writing algorithms and libraries it would be useful to have "hooks" in the type and ...
Antoniotti, Marco
core +1 more source
Prolog: subsumption of equality axioms by the homogeneous form [PDF]
, 1989 The paper analyses the application of the homogeneous form of PROLOG programs to programs with equality. It is shown that the transformation to homogeneous form directly subsumes the transitivity and predicate substitutivity axioms of equality ...
Elcock, E.W.
core +1 more source
Yet another decision procedure for equality logic [PDF]
, 2005 . We introduce a new decision procedure for Equality Logic. The procedure improves on Bryant and Velev’s sparse method [4] from CAV’00, in which each equality predicate is encoded with a Boolean variable, and then a set of transitivity constraints are ...
Ofer Strichman, Orly Meir
core +1 more source
Mathematical foundations of epistemology based on experiments
Vestnik Samarskogo Gosudarstvennogo Tehničeskogo Universiteta. Seriâ: Fiziko-Matematičeskie Nauki, 2015 The paper deals with basic prerequisites for the development of epistemology, which uses information concerning real experiments in the real world (with real objects).
Sergey M Krylov
doaj +1 more source