The following pages link to Metafinite model theory (Q1383163):
Displaying 27 items.
- A new thesis concerning synchronised parallel computing -- simplified parallel ASM thesis (Q313981) (← links)
- Expressive power and abstraction in Essence (Q941820) (← links)
- From a zoo to a zoology: Towards a general theory of graph polynomials (Q1015377) (← links)
- Finitely representable databases (Q1376408) (← links)
- Queries with arithmetical constraints (Q1391932) (← links)
- Expressive power of SQL. (Q1401278) (← links)
- On elementary logics for quantitative dependencies (Q2172823) (← links)
- Periodic generalized automata over the reals (Q2280333) (← links)
- Computing queries with higher-order logics (Q2369013) (← links)
- A Proof System with Bounded Non-determinism in Database Transformations (Q3092325) (← links)
- Database Theory, Yuri, and Me (Q3585996) (← links)
- The Computational Complexity of Quantified Reciprocals (Q3623832) (← links)
- (Q4346400) (← links)
- (Q4698613) (← links)
- On polynomial time computation over unordered structures (Q4779654) (← links)
- Safe Recursion Over an Arbitrary Structure: PAR, PH and DPH (Q4916232) (← links)
- Expressibility of Higher Order Logics (Q4924534) (← links)
- Logics which capture complexity classes over the reals (Q5055931) (← links)
- (Q5216300) (← links)
- Primitive recursion in the abstract (Q5220181) (← links)
- (Q5693583) (← links)
- (Q5711885) (← links)
- Tractability frontiers in probabilistic team semantics and existential second-order logic over the reals (Q5918401) (← links)
- Tractability frontiers in probabilistic team semantics and existential second-order logic over the reals (Q5918795) (← links)
- Metafinite model theory (Q6064289) (← links)
- Logics with probabilistic team semantics and the Boolean negation (Q6545573) (← links)
- Logical characterizations of algebraic circuit classes over integral domains (Q6620024) (← links)
