Pages that link to "Item:Q703863"

The following pages link to Finite model theory and its applications. (Q703863):

Displaying 50 items.

• A logical approach to locality in pictures languages (Q295631) (← links)
• Type extension trees for feature construction and learning in relational domains (Q490428) (← links)
• Elements of finite model theory. (Q703864) (← links)
• An Ehrenfeucht-Fraïssé game approach to collapse results in database theory (Q870360) (← links)
• From Hilbert's program to a logic tool box (Q1028646) (← links)
• A restricted second order logic for finite structures (Q1271559) (← links)
• Metafinite model theory (Q1383163) (← links)
• On the computation of zone and double zone diagrams (Q1704894) (← links)
• The descriptive complexity of decision problems through logics with relational fixed-point and capturing results (Q1744448) (← links)
• Coherence and computational complexity of quantifier-free dependence logic formulas (Q1956380) (← links)
• Consistent query answering for primary keys in Datalog (Q2035471) (← links)
• A game for linear-time-branching-time spectroscopy (Q2044187) (← links)
• Some thoughts on knowledge-enhanced machine learning (Q2237522) (← links)
• The finite model theory of Bayesian network specifications: descriptive complexity and zero/one laws (Q2283277) (← links)
• Two first-order logics of permutations (Q2299614) (← links)
• Tight lower and upper bounds for the complexity of canonical colour refinement (Q2398207) (← links)
• The semijoin algebra and the guarded fragment (Q2567344) (← links)
• Descriptive complexity of deterministic polylogarithmic time and space (Q2662676) (← links)
• A Logical Approach to Data-Aware Automated Sequence Generation (Q2889859) (← links)
• Choiceless Polynomial Time on Structures with Small Abelian Colour Classes (Q2922002) (← links)
• Computational Complexity Via Finite Types (Q2946764) (← links)
• Is Polynomial Time Choiceless? (Q2947174) (← links)
• A Dichotomy Result for Ramsey Quantifiers (Q2947460) (← links)
• On the Complexity of the Model Checking Problem (Q3176188) (← links)
• The mu-calculus and Model Checking (Q3176384) (← links)
• About the Temporal Logic of the Lexicographic Products of Unbounded Dense Linear Orders: A New Study of Its Computability (Q3298275) (← links)
• On Models of a Nondeterministic Computation (Q3392968) (← links)
• The Descriptive Complexity of Parity Games (Q3540190) (← links)
• Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs (Q3586010) (← links)
• Fixed-Point Definability and Polynomial Time (Q3644737) (← links)
• (Q4255575) (← links)
• Computation over algebraic structures and a classification of undecidable problems (Q4593236) (← links)
• (Q4625692) (← links)
• RANK LOGIC IS DEAD, LONG LIVE RANK LOGIC! (Q4628673) (← links)
• (Q4638077) (← links)
• Quirky Quantifiers: Optimal Models and Complexity of Computation Tree Logic (Q4639929) (← links)
• (Q4683860) (← links)
• Some Aspects of Model Theory and Finite Structures (Q4779635) (← links)
• On the complexity of team logic and its two-variable fragment (Q5005127) (← links)
• Deciding Parity Games in Quasi-polynomial Time (Q5073521) (← links)
• (Q5090942) (← links)
• (Q5091138) (← links)
• (Q5091268) (← links)
• Choiceless Logarithmic Space (Q5092391) (← links)
• (Q5101344) (← links)
• (Q5101352) (← links)
• Topological elementary equivalence of regular semi‐algebraic sets in three‐dimensional space (Q5109238) (← links)
• Games for Inclusion Logic and Fixed-Point Logic (Q5213642) (← links)
• Characterizing polynomial Ramsey quantifiers (Q5377702) (← links)
• A Logical Approach to Constraint Satisfaction (Q5504702) (← links)