Everything about Branching quantifier

🧭 Start here: a 6-step reading path

1. Read the overview: Branching quantifierA 5-minute orientation
2. Pick up a classic book: Treaty Occupationay ToxicologyThe most-reprinted book on the subject
3. Read the landmark paper: On the Semantics of Branching Quantifier SentencesCited 0 times
4. Go sideways: Dependence logicA closely related topic
5. Go sideways: Second-order logicA closely related topic

🏆 Landmark papers (most cited)

• On the Semantics of Branching Quantifier Sentences

  Theo M.V. Janssen · 2003 · Proceedings of the Amsterdam Colloquium · 0 citations

📚 Books worth reading

• Treaty Occupationay ToxicologySuelen Queiroz · 2010
• Logic in Computer ScienceMark Ryan · 1999
• 📕A remote sensing technique for quantifying lobster fishing effortJ. D Pringle · 1983
• 📕Methods to quantify seepage beneath Levee 30, Miami-Dade County, FloridaR. S. Sonenshein · 2001
• 📕A SEASAT SASS simulation experiment to quantify the errors related to a 3-hour intermittent assimilation techniqueWinfield B Sylvester · 1984
• 📕Evaluation of the use of reach transmissivity to quantify leakage beneath Levee 31N, Miami-Dade County, FloridaMark S. Nemeth · 2000
• Logical derivation of computer programsThomas G. Windeknecht · 1999
• Cardiovascular developmentPeng, Xu M.D., Ph.D., Marc Antonyak · 2012

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics

• Dependence logic Dependence logic is a logical formalism, created by Jouko Väänänen, which adds dependence atoms to the language of first-order logic. A dependence atom…
• Second-order logic In logic and mathematics, second-order logic is an extension of first-order logic, which itself is an extension of propositional logic. Second-order logic…
• Independence-friendly logic Independence-friendly logic (IF logic; proposed by Jaakko Hintikka and Gabriel Sandu [fr] in 1989) is an extension of classical first-order logic (FOL)…
• Interpretation (model theory) In model theory, interpretation of a structure M in another structure N (typically of a different signature) is a technical notion that approximates the…
• Original proof of Gödel's completeness theorem The proof of Gödel's completeness theorem given by Kurt Gödel in his doctoral dissertation of 1929 (and a shorter version of the proof, published as an…
• Generalized quantifier In formal semantics, a generalized quantifier (GQ) is an expression that denotes a set of sets. This is the standard semantics assigned to quantified noun…
• True quantified Boolean formula In computational complexity theory, the language TQBF is a formal language consisting of the true quantified Boolean formulas. A (fully) quantified Boolean…
• Well-quasi-ordering In mathematics, specifically order theory, a well-quasi-ordering or wqo on a set X is a quasi-ordering of X for which every infinite sequence of elements…