Sciweavers

1943 search results - page 50 / 389
» Ordering Default Theories
Sort
View
ENTCS
2006
161views more  ENTCS 2006»
14 years 11 months ago
Tool Building Requirements for an API to First-Order Solvers
Effective formal verification tools require that robust implementations of automatic procedures for first-order logic and satisfiability modulo theories be integrated into express...
Jim Grundy, Thomas F. Melham, Sava Krstic, Sean Mc...
IJACDT
2011
125views more  IJACDT 2011»
14 years 3 months ago
Becoming Creative through Self Observation: A (Second Order) Cybernetic Learning Strategy for the Metaverse
This study wishes to describe some of the key components of an art educational domain entitled ground<c>, which is being developed specifically for three dimensional online ...
Elif E. Ayiter
TLCA
2005
Springer
15 years 5 months ago
Recursive Functions with Higher Order Domains
In a series of articles, we developed a method to translate general recursive functions written in a functional programming style into constructive type theory. Three problems rema...
Ana Bove, Venanzio Capretta
APAL
2006
45views more  APAL 2006»
14 years 12 months ago
On properties of theories which preclude the existence of universal models
We introduce the oak property of first order theories, which is a syntactical condition that we show to be sufficient for a theory not to have universal models in cardinality whe...
Mirna Dzamonja, Saharon Shelah
RSA
1998
59views more  RSA 1998»
14 years 11 months ago
Random unary predicates: Almost sure theories and countable models
Let Un,p be the random unary predicate and Tk the almost sure first-order theory of Un,p under the linear ordering, where k is a positive integer and n−1/k p(n) n−1/(k+1) . F...
Joel Spencer, Katherine St. John