Sciweavers

245 search results - page 29 / 49
» Class Algebra as a Description Logic
Sort
View
DIMACS
1996
15 years 1 months ago
Easier Ways to Win Logical Games
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
Ronald Fagin
102
Voted
JSYML
2010
107views more  JSYML 2010»
14 years 11 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
LATIN
2004
Springer
15 years 5 months ago
Approximating the Expressive Power of Logics in Finite Models
Abstract. We present a probability logic (essentially a first order language extended with quantifiers that count the fraction of elements in a model that satisfy a first order ...
Argimiro Arratia, Carlos E. Ortiz
82
Voted
STACS
2000
Springer
15 years 4 months ago
The Complexity of Poor Man's Logic
Motivated by description logics, we investigate what happens to the complexity of modal satisfiability problems if we only allow formulas built from literals, , 3, and 2. Previous...
Edith Hemaspaandra
112
Voted
LOGCOM
2010
136views more  LOGCOM 2010»
14 years 11 months ago
Combining Derivations and Refutations for Cut-free Completeness in Bi-intuitionistic Logic
Bi-intuitionistic logic is the union of intuitionistic and dual intuitionistic logic, and was introduced by Rauszer as a Hilbert calculus with algebraic and Kripke semantics. But ...
Rajeev Goré, Linda Postniece