Pages that link to "Item:Q920075"

The following pages link to 0-1 laws and decision problems for fragments of second-order logic (Q920075):

Displaying 18 items.

• Testable and untestable classes of first-order formulae (Q440006) (← links)
• On the expressive power of counting (Q672336) (← links)
• Finite-model theory -- A personal perspective (Q688663) (← links)
• Satisfiability of formulae with one \(\forall\) is decidable in exponential time (Q915716) (← links)
• Infinitary logics and 0-1 laws (Q1193591) (← links)
• The quantifier structure of sentences that characterize nondeterministic time complexity (Q1198956) (← links)
• Finitistic proofs of 0-1 laws for fragments of second-order logic (Q1351145) (← links)
• 0-1 laws by preservation (Q1390939) (← links)
• The 0-1 law fails for monadic existential second-order logic on undirected graphs (Q1607080) (← links)
• Normal forms for second-order logic over finite structures, and classification of NP optimization problems (Q1919763) (← links)
• Zero-one law and definability of linear order (Q3616345) (← links)
• Relational Properties Expressible with One Universal Quantifier Are Testable (Q3646124) (← links)
• On the Decision Problem for Two-Variable First-Order Logic (Q4338040) (← links)
• On the expressiveness of frame satisfiability and fragments of second-order logic (Q4391423) (← links)
• Strong extension axioms and Shelah's zero-one law for choiceless polynomial time (Q4457727) (← links)
• Asymptotic conditional probabilities: The non-unary case (Q4879912) (← links)
• Counterexamples of the 0-1 Law for Fragments of Existential Second-Order Logic: an Overview (Q4953235) (← links)
• Logical properties of random graphs from small addable classes (Q5227515) (← links)