Sciweavers

175 search results - page 1 / 35
» A Complete and Recursive Feature Theory
Sort
View
ACL
1993
13 years 6 months ago
A Complete and Recursive Feature Theory
Various feature descriptions are being employed in constrained-based grammar formalisms. The common notational primitive of these descriptions are functional attributes called fea...
Rolf Backofen, Gert Smolka
JSYML
2010
107views more  JSYML 2010»
13 years 3 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
MLQ
2006
78views more  MLQ 2006»
13 years 4 months ago
Recursive logic frames
We define the concept of a logic frame, which extends the concept stract logic by adding the concept of a syntax and an axiom system. In a recursive logic frame the syntax and the...
Saharon Shelah, Jouko A. Väänänen
UC
2009
Springer
13 years 11 months ago
On the Brightness of the Thomson Lamp: A Prolegomenon to Quantum Recursion Theory
Some physical aspects related to the limit operations of the Thomson lamp are discussed. Regardless of the formally unbounded and even infinite number of “steps” involved, the...
Karl Svozil
ISAAC
2005
Springer
109views Algorithms» more  ISAAC 2005»
13 years 10 months ago
Recursion Theoretic Operators for Function Complexity Classes
We characterize the gap between time and space complexity of functions by operators and completeness. First, we introduce a new notion of operators for function complexity classes ...
Kenya Ueno