The following pages link to Elements of finite model theory. (Q703864):
Displaying 50 items.
- On the Parameterised Intractability of Monadic Second-Order Logic (Q3644759) (← links)
- (Q4255575) (← links)
- The logic of informational independence and finite models (Q4340930) (← links)
- Short Monadic Second Order Sentences about Sparse Random Graphs (Q4562315) (← links)
- Separation logics and modalities: a survey (Q4586138) (← links)
- Computability of validity and satisfiability in probability logics over finite and countable models (Q4586148) (← links)
- (Q4625692) (← links)
- Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic (Q4637759) (← links)
- (Q4638077) (← links)
- Yes, the “missing axiom” of matroid theory is lost forever (Q4642529) (← links)
- (Q5002820) (← links)
- Logical complexity of induced subgraph isomorphism for certain families of graphs (Q5003303) (← links)
- REDUCTION TECHNIQUES FOR PROVING DECIDABILITY IN LOGICS AND THEIR MEET–COMBINATION (Q5009679) (← links)
- (Q5013886) (← links)
- (Q5015284) (← links)
- (Q5018506) (← links)
- (Q5021228) (← links)
- On the Tutte and Matching Polynomials for Complete Graphs (Q5038571) (← links)
- Trakhtenbrot’s Theorem in Coq (Q5048993) (← links)
- Undecidability of QLTL and QCTL with two variables and one monadic predicate letter (Q5059700) (← links)
- Cyclic congruences of slim semimodular lattices and non-finite axiomatizability of some finite structures (Q5071539) (← links)
- Rational, recognizable, and aperiodic partially lossy queue languages (Q5075703) (← links)
- Relating Structure and Power: Comonadic Semantics for Computational Resources (Q5079721) (← links)
- (Q5079744) (← links)
- Complexity of the Steiner Network Problem with Respect to the Number of Terminals (Q5090473) (← links)
- (Q5091117) (← links)
- (Q5091138) (← links)
- (Q5092394) (← links)
- (Q5094127) (← links)
- (Q5094147) (← links)
- EMSO(FO$^2$) 0-1 Law Fails for All Dense Random Graphs (Q5096587) (← links)
- Expressive Power and Succinctness of the Positive Calculus of Relations (Q5098722) (← links)
- Computer-Supported Exploration of a Categorical Axiomatization of Modeloids (Q5098730) (← links)
- (Q5109511) (← links)
- (Q5111249) (← links)
- Logical laws for short existential monadic second-order sentences about graphs (Q5118048) (← links)
- (Q5129949) (← links)
- Successor-Invariant First-Order Logic on Classes of Bounded Degree (Q5145657) (← links)
- On the Computational Complexity of Non-Dictatorial Aggregation (Q5154769) (← links)
- (Q5155668) (← links)
- Recursive Definitions and Fixed-Points (Q5178958) (← links)
- Measurement-Theoretic Foundations of Observational-Predicate Logic (Q5213673) (← links)
- (Q5216300) (← links)
- Conversation and Games (Q5224486) (← links)
- Logical properties of random graphs from small addable classes (Q5227515) (← links)
- Limiting Until in Ordered Tree Query Languages (Q5277915) (← links)
- Two-Variable Logic with Counting and Trees (Q5278191) (← links)
- Where First-Order and Monadic Second-Order Logic Coincide (Q5278195) (← links)
- (Q5376663) (← links)
- Extending two-variable logic on data trees with order on data values and its automata (Q5410335) (← links)
