7 search results - page 1 / 2 » New spectra of strongly minimal theories in finite languages |
APAL
2011
13 years 2 months ago
2011
We describe strongly minimal theories Tn with finite languages such that in the chain of countable models of Tn, only the first n models have recursive presentations. Also, we d...
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
We take a dual view of Markov processes ? advocated by Kozen ? as transformers of bounded measurable functions. We redevelop the theory of labelled Markov processes from this view ...
ICALP
2000
Springer
13 years 11 months ago
2000
Springer
We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and partial transve...
COLT
1994
Springer
13 years 11 months ago
1994
Springer
Inductive Logic Programming (ILP) involves the construction of first-order definite clause theories from examples and background knowledge. Unlike both traditional Machine Learnin...
BSL
2004
13 years 7 months ago
2004
This paper ties together much of the model theory of the last 50 years. Shelah's attempts to generalize the Morley theorem beyond first order logic led to the notion of excel...