Sciweavers

9405 search results - page 73 / 1881
» Computing a Model of Set Theory
Sort
View
CIE
2007
Springer
15 years 4 months ago
A Useful Undecidable Theory
Abstract. We show that many so called discrete weak semilattices considered earlier in a series of author’s publications have hereditary undecidable first-order theories. Since ...
Victor L. Selivanov
BALT
2006
15 years 1 months ago
On Ontology, ontologies, Conceptualizations, Modeling Languages, and (Meta)Models
In philosophy, the term ontology has been used since the 17th century to refer both to a philosophical discipline (Ontology with a capital "O"), and as a domain-independe...
Giancarlo Guizzardi
FSTTCS
2004
Springer
15 years 3 months ago
Join Algorithms for the Theory of Uninterpreted Functions
The join of two sets of facts, E1 and E2, is defined as the set of all facts that are implied independently by both E1 and E2. Congruence closure is a widely used representation f...
Sumit Gulwani, Ashish Tiwari, George C. Necula
JSYML
2010
107views more  JSYML 2010»
14 years 8 months ago
A proof of completeness for continuous first-order logic
Continuous first-order logic has found interest among model theorists who wish to extend the classical analysis of “algebraic” structures (such as fields, group, and graphs) ...
Arthur Paul Pedersen, Itay Ben-Yaacov
ISIPTA
2003
IEEE
127views Mathematics» more  ISIPTA 2003»
15 years 3 months ago
Climate Projections for the 21st Century Using Random Sets
We apply random set theory to an analysis of future climate change. Bounds on cumulative probability are used to quantify uncertainties in natural and socio-economic factors that ...
Elmar Kriegler, Hermann Held