611 search results - page 8 / 123 » Index Sets of Computable Structures with Decidable Theories |
MFCS
2005
Springer
14 years 1 months ago
2005
Springer
This paper investigates the word problem for inverse monoids generated by a set Γ subject to relations of the form e = f, where e and f are both idempotents in the free inverse m...
JSYML
2010
13 years 6 months ago
2010
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) ...
RTA
2005
Springer
14 years 1 months ago
2005
Springer
We present constructive arithmetic in Deduction modulo with rewrite rules only. In natural deduction and in sequent calculus, the cut elimination theorem and the analysis of the st...
EUROCAST
2007
Springer
13 years 11 months ago
2007
Springer
abstract Parsing schemata [4] provide a formal, simple and uniform way to describe, analyze and compare different parsing algorithms. The notion of a parsing schema comes from cons...
ICDT
2012
ACM
11 years 10 months ago
2012
ACM
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...