Results 11 to 20 of about 41 (33)

Canonical varieties with no canonical axiomatisation [PDF]

, 2005
Accepted ...
Yde Venema, Ian Hodkinson, Hodkinson, I, Venema, Y, Hodkinson, I., Venema, Y.   +5 more
core   +1 more source

Polyadic soft constraints

, 2019
We propose a formalism for manipulating soft constraints based on polyadic algebras. The choice of such algebras in place of classical cylindric ones simplifies the structure of the partial order of preference values by removing diagonals, a family of ...
Laura Bussi, Filippo Bonchi, Francesco Santini, Fabio Gadducci, Bussi L., Gadducci F., Santini F., Bonchi F.   +7 more
core   +2 more sources

Some variants of Vaught’s conjecture from the perspective of algebraic logic [PDF]

, 2012
Vaught’s Conjecture states that if T is a complete first order theory in a countable language such that T has uncountably many pairwise non-isomorphic countably infinite models, then T has 2^ℵ_0 many pairwise non-isomorphic countably infinite models ...
Sági, Gábor, Sziráki, Dorottya
core   +1 more source

The k-variable property is stronger than H-dimension k [PDF]

, 1997
Accepted ...
Hodkinson, I, Simon, A
core   +1 more source

The number of countable models via Algebraic logic [PDF]

, 2013
Vaught's Conjecture states that if T is a complete First order theory in a countable language that has more than aleph_0 pairwise non isomorphic countable models, then T has 2^aleph_0 such models.
Sági, Gábor, Sayed-Ahmed, Tarek, Sziráki, Dorottya, Assem, Mohammad   +3 more
core   +1 more source

Weak products of universal algebras [PDF]

, 1993
Weak direct products of arbitrary universal algebras are introduced. The usual notion for groups and rings is a special case. Some universal algebraic properties are proved and applications to cylindric and polyadic algebras are ...
Sain, Ildikó
core  

Notions of density that imply representability in algebraic logic

, 1998
Henkin and Tarski proved that an atomic cylindric algebra in which every atom is a rectangle must be representable (as a cylindric set algebra). This theorem and its analogues for quasi-polyadic algebras with and without equality are formulated in Henkin,
Givant, S., Andreka, H., Mikulas, Szabolcs, Simon, A., Nemeti, I.   +4 more
core   +1 more source

Lambda Abstraction algebras: representation theorems

, 1995
Lambda abstraction algebras (LAAs) are designed to algebraize the untyped lambda calculus in the same way cylindric and polyadic algebras algebraize the first-order predicate logic.
SALIBRA A., D. PIGOZZI, D.PIGOZZI, Don Pigozzi, Antonino Salibra, SALIBRA, Antonino   +5 more
core   +1 more source

Reconciling First-Order Logic to Algebra

, 2018
We start from the algebraic method of theorem-proving based on the translation of logic formulas into polynomials over finite fields, and adapt the case of first-order formulas by employing certain rings equipped with infinitary operations.
Mariana Matulovic, Carnielli, Walter, Luiz Mariano, Hugo, Hugo Luiz Mariano, Walter Carnielli, Matulovic, Mariana [UNESP]   +5 more
core   +1 more source

Bare Canonicity of Representable Cylindric and Polyadic Algebras [PDF]

Annals of Pure and Applied Logic, 2013
Hodkinson, I, Bulian, J
exaly   +2 more sources