Results 201 to 210 of about 39,700 (212)

An algorithm for computing theory prime implicates in first order logic

open access: closedInternational Journal of Information and Communication Technology, 2007
An algorithm based on consensus method to compute the set of prime implicates of a quantifier free first order formula X was presented in an earlier work. In this paper the notion of prime implicates is extended to theory prime implicates in the first order case.
Arindama Singh, Manoj K. Raut
openaire   +3 more sources

The theory of integer multiplication with order restricted to primes is decidable

open access: closedJournal of Symbolic Logic, 1997
AbstractWe show here that the first order theory of the positive integers equipped with multiplication remains decidable when one adds to the language the usual order restricted to the prime numbers. We see moreover that the complexity of the latter theory is a tower of exponentials, of height O(n).
Françoise Maurin
openaire   +3 more sources

Uniqueness and characterization of prime models over sets for totally transcendental first-order theories

open access: closedJournal of Symbolic Logic, 1972
If T is a complete first-order totally transcendental theory then over every T-structure A there is a prime model unique up to isomorphism over A. Moreover M is a prime model over A iff: (1) every finite sequence from M realizes an isolated type over A, and (2) there is no uncountable indiscernible set over A in M.The existence of prime models was ...
Saharon Shelah
openaire   +3 more sources

Home - About - Disclaimer - Privacy