language:
Find link is a tool written by Edward Betts.Longer titles found: Monadic second-order logic (view)
searching for Second-order logic 27 found (160 total)
alternate case: second-order logic
Trémaux tree
(2,302 words)
[view diff]
exact match in snippet
view article
find links to article
planar graph. A characterization of Trémaux trees in the monadic second-order logic of graphs allows graph properties involving orientations to be recognizedJouko Väänänen (534 words) [view diff] no match in snippet view article find links to article
branches, Topology Proceedings vol. 28:1, 2004, 113-132. J. Väänänen, Second order logic or set theory?, Bulletin of Symbolic Logic, 18(1), 91-121, 2012. JStewart Shapiro (326 words) [view diff] case mismatch in snippet view article find links to article
ISBN 0-19-289306-8 Foundations without Foundationalism: A Case for Second-Order Logic. Oxford University Press, 1991. ISBN 0-19-853391-8 Vagueness in ContextLogic (16,460 words) [view diff] no match in snippet view article find links to article
2021. Audi 1999b, Philosophy of logic; Väänänen 2021; Ketland 2005, Second Order Logic. Audi 1999b, Philosophy of logic; Väänänen 2021; Daintith & WrightHosoya index (894 words) [view diff] exact match in snippet view article find links to article
parameter complexity of graph enumeration problems definable in monadic second-order logic" (PDF), Discrete Applied Mathematics, 108 (1–2): 23–52, doi:10Michael Resnik (422 words) [view diff] case mismatch in snippet view article find links to article
"Impartial Welfarism and the Concept of a Person". Erkenntnis. 1986. "Second-order Logic Still Wild!". Journal of Philosophy. 1988. "Between Mathematics andOperator-precedence grammar (1,283 words) [view diff] exact match in snippet view article find links to article
characterizations based on an equivalent form of automata and monadic second-order logic. Aho, Sethi & Ullman 1988, p. 203 Aho, Sethi & Ullman 1988, pp. 203–204Matching polynomial (882 words) [view diff] exact match in snippet view article find links to article
parameter complexity of graph enumeration problems definable in monadic second-order logic" (PDF), Discrete Applied Mathematics, 108 (1–2): 23–52, doi:10Philosophy of logic (11,722 words) [view diff] exact match in snippet view article find links to article
arithmetic and Zermelo-Fraenkel set theory in first-order logic, while second-order logic only needs a handful of axioms to do the same job. But this increasedPhilosophical logic (7,043 words) [view diff] exact match in snippet view article find links to article
to be expressed in first-order logic. But they can be expressed in second-order logic with only a few axioms. But despite this advantage, first-order logicPolynomial hierarchy (2,826 words) [view diff] exact match in snippet view article find links to article
reformulation of this problem is that PH = PSPACE if and only if second-order logic over finite structures gains no additional power from the additionJesús Mosterín (4,526 words) [view diff] no match in snippet view article find links to article
logic and set theory in Spanish. He has worked on topics of first and second order logic, axiomatic set theory, computability and complexity. He has shownRegular tree grammar (1,300 words) [view diff] case mismatch in snippet view article find links to article
Finite Automata Theory with an Application to a Decision Problem of Second-Order Logic". Mathematical Systems Theory. 2 (1): 57–81. doi:10.1007/BF01691346Unifying Theories of Programming (853 words) [view diff] exact match in snippet view article find links to article
first-order predicate calculus, augmented with fixed point constructs from second-order logic. Following the tradition of Eric Hehner, programs are predicates inPhokion G. Kolaitis (630 words) [view diff] case mismatch in snippet view article find links to article
Mendelzon Test-of-Time Award for the paper “Composing Schema Mappings: Second-Order Logic to the Rescue” (co-authored with R. Fagin, L. Popa, and W.-C. Tan)Glossary of graph theory (16,011 words) [view diff] no match in snippet view article find links to article
test whether two vertices are adjacent. To be distinguished from second order logic, in which variables can also represent sets of vertices or edges.Transversal (combinatorics) (1,655 words) [view diff] case mismatch in snippet view article
Bruno Courcelle; Joost Engelfriet (2012). Graph Structure and Monadic Second-Order Logic: A Language-Theoretic Approach. Cambridge University Press. p. 95Bramble (graph theory) (955 words) [view diff] exact match in snippet view article
brambles, grid-like minors, and parameterized intractability of monadic second-order logic", Proceedings of the Twenty-First Annual ACM-SIAM Symposium on DiscreteNijaz Ibrulj (977 words) [view diff] case mismatch in snippet view article find links to article
in Ancient Philosophy in The Logical Foresight, 1/2022, Basics of Second-Order Logic in The Logical Foresight, 1/2023, Aristotle's First Philosophy asK-outerplanar graph (564 words) [view diff] exact match in snippet view article find links to article
treewidth by finite state tree automata is definable in the monadic second-order logic of graphs, has been proven for the k {\displaystyle k} -outerplanarCograph (2,689 words) [view diff] exact match in snippet view article find links to article
Courcelle's theorem may be used to test any property in the monadic second-order logic of graphs (MSO1) on cographs in linear time. The problem of testingKleene Award (126 words) [view diff] case mismatch in snippet view article find links to article
Value-Passing Processes" 1998 Jean-Marie Le Bars "Fragments of Existential Second-Order Logic without 0-1 Laws" 2000 Lars Birkedal "A General Notion of Realizability"Nested word (3,063 words) [view diff] exact match in snippet view article find links to article
nested words are exactly the set of languages described by monadic second-order logic with two unary predicates call and return, linear successor and theInternational Conference on Concurrency Theory (954 words) [view diff] no match in snippet view article find links to article
Completeness of the Propositional mu-Calculus with Respect to Monadic Second Order Logic." (CONCUR 1996) Roberto Segala & Nancy Lynch: "Probabilistic SimulationsCyclic order (6,392 words) [view diff] case mismatch in snippet view article find links to article
Bruno; Engelfriet, Joost (April 2011), Graph Structure and Monadic Second-Order Logic, a Language Theoretic Approach (PDF), Cambridge University Press,Zermelo's categoricity theorem (385 words) [view diff] case mismatch in snippet view article find links to article
396 S. Shapiro, Foundations Without Foundationalism: A Case for Second-order Logic (1991). G. Uzquiano, "Models of Second-Order Zermelo Set Theory".Regular numerical predicate (2,190 words) [view diff] no match in snippet view article find links to article
{\displaystyle P} are regular. The same property would hold for the monadic second order logic, and with modular quantifiers. The following property allows to reduce