Tagged Questions
0
votes
0answers
28 views
Is a satisfiable FOL-sentence a prime event structure always satisfiable in a regular trace event structure?
Suppose first-order logic sentence is satisfiable in the class of prime event structure. Is it also satisfiable in some regular trace event structure? (for all notions I'm referring to Madhusudan's ...
1
vote
2answers
137 views
Sequences of a computable function
Is there any computable function $f(n)$, which given any integer $n$ has been proven to return either $0$ or $1$ in finite time, and for which the statement "$f(1), f(2), f(3),\ldots$ contains ...
1
vote
1answer
145 views
Structure and Formula encoding for Turing Machine
During my study of Finite Model Theory I found that usually purely relational structure say $\mathcal{M} = \langle A, R_1,\ldots,R_k \rangle$ are encoded as
...
