S2S (mathematics) (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "S2S (mathematics)" in English language version.

refsWebsite

Global rank English rank

10doi.org

2^nd place

7arxiv.org

69^th place

59^th place

5semanticscholar.org

11^th place

8^th place

2logic.at

low place

2jstor.org

26^th place

20^th place

2archives-ouvertes.fr

1,031^st place

879^th place

1ams.org

451^st place

277^th place

1purdue.edu

850^th place

625^th place

1springer.com

274^th place

309^th place

1mathoverflow.net

low place

1ucla.edu

782^nd place

585^th place

1nyu.edu

1,174^th place

773^rd place

1core.ac.uk

1,734^th place

1,312^th place

1episciences.org

low place

1auckland.ac.nz

4,539^th place

2,858^th place

1mccme.ru

low place

ams.org

Rabin, Michael (1969). "Decidability of second-order theories and automata on infinite trees" (PDF). Transactions of the American Mathematical Society. 141.

archives-ouvertes.fr

hal.archives-ouvertes.fr

Janin, David; Lenzi, Giacomo. On the Structure of the Monadic Logic of the Binary Tree. MFCS 1999. doi:10.1007/3-540-48340-3_28.

hal-upec-upem.archives-ouvertes.fr

Carayol, Arnaud; Löding, Christof (2007), "MSO on the Infinite Binary Tree: Choice and Order" (PDF), Computer Science Logic, Lecture Notes in Computer Science, vol. 4646, pp. 161–176, doi:10.1007/978-3-540-74915-8_15, ISBN 978-3-540-74914-1, S2CID 14580598

arxiv.org

Das, Anupam; Riba, Colin (2020). "A functional (monadic) second-order theory of infinite trees". Logical Methods in Computer Science. 16 (4). arXiv:1903.05878. doi:10.23638/LMCS-16(4:6)2020. S2CID 76666389. (A preliminary 2015 version erroneously claimed proof of completeness without the determinacy schema.)
Bojańczyk, Mikołaj; Parys, Paweł; Toruńczyk, Szymon (2015), The MSO+U theory of (N, <) is undecidable, arXiv:1502.04578
Bojańczyk, Mikołaj (2014), Weak MSO+U with path quantifiers over infinite trees, arXiv:1404.7278
Kołodziejczyk, Leszek; Michalewski, Henryk (2016). How unprovable is Rabin's decidability theorem?. LICS '16: 31st Annual ACM/IEEE Symposium on Logic in Computer Science. arXiv:1508.06780.
Piterman, Nir (2006). From Nondeterministic Buchi and Streett Automata to Deterministic Parity Automata. 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06). pp. 255–264. arXiv:0705.2205. doi:10.1109/LICS.2006.28.
Löding, Christof; Pirogov, Anton. Determinization of Büchi Automata: Unifying the Approaches of Safra and Muller-Schupp. ICALP 2019. arXiv:1902.02139.
Shelah, Saharon (Nov 1975). "Monadic theory of order" (PDF). Annals of Mathematics. 102 (3): 379–419. arXiv:2305.00968. doi:10.2307/1971037. JSTOR 1971037. S2CID 122129926.

auckland.ac.nz

researchspace.auckland.ac.nz

Calude, Cristian; Jain, Sanjay; Khoussainov, Bakhadyr; Li, Wei; Stephan, Frank. Deciding parity games in quasipolynomial time (PDF). STOC 2017.

core.ac.uk

Heinatsch, Christoph; Möllerfeld, Michael (2010). "The determinacy strength of Π¹₂-comprehension" (PDF). Annals of Pure and Applied Logic. 161 (12): 1462–1470. doi:10.1016/j.apal.2010.04.012.

doi.org

Janin, David; Lenzi, Giacomo. On the Structure of the Monadic Logic of the Binary Tree. MFCS 1999. doi:10.1007/3-540-48340-3_28.
Riba, Colin (2012). A model theoretic proof of completeness of an axiomatization of monadic second-order logic on infinite words (PDF). TCS 2012. doi:10.1007/978-3-642-33475-7_22.
Carayol, Arnaud; Löding, Christof (2007), "MSO on the Infinite Binary Tree: Choice and Order" (PDF), Computer Science Logic, Lecture Notes in Computer Science, vol. 4646, pp. 161–176, doi:10.1007/978-3-540-74915-8_15, ISBN 978-3-540-74914-1, S2CID 14580598
Das, Anupam; Riba, Colin (2020). "A functional (monadic) second-order theory of infinite trees". Logical Methods in Computer Science. 16 (4). arXiv:1903.05878. doi:10.23638/LMCS-16(4:6)2020. S2CID 76666389. (A preliminary 2015 version erroneously claimed proof of completeness without the determinacy schema.)
Gurevich, Yuri; Shelah, Saharon (1984). "The monadic theory and the "next world"". Israel Journal of Mathematics. 49 (1–3): 55–68. doi:10.1007/BF02760646. S2CID 15807840.
Gurevich, Yuri; Magidor, Menachem; Shelah, Saharon (1993). "The monadic theory of ω₂" (PDF). The Journal of Symbolic Logic. 48 (2): 387–398. doi:10.2307/2273556. JSTOR 2273556. S2CID 120260712.
Neeman, Itay (2008), "Monadic definability of ordinals" (PDF), Computational Prospects of Infinity, Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore, vol. 15, pp. 193–205, doi:10.1142/9789812796554_0010, ISBN 978-981-279-654-7
Heinatsch, Christoph; Möllerfeld, Michael (2010). "The determinacy strength of Π¹₂-comprehension" (PDF). Annals of Pure and Applied Logic. 161 (12): 1462–1470. doi:10.1016/j.apal.2010.04.012.
Piterman, Nir (2006). From Nondeterministic Buchi and Streett Automata to Deterministic Parity Automata. 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06). pp. 255–264. arXiv:0705.2205. doi:10.1109/LICS.2006.28.
Shelah, Saharon (Nov 1975). "Monadic theory of order" (PDF). Annals of Mathematics. 102 (3): 379–419. arXiv:2305.00968. doi:10.2307/1971037. JSTOR 1971037. S2CID 122129926.

episciences.org

lmcs.episciences.org

Kołodziejczyk, Leszek; Michalewski, Henryk; Pradic, Pierre; Skrzypczak, Michał (2019). "The logical strength of Büchi's decidability theorem". Logical Methods in Computer Science. 15 (2): 16:1–16:31.

jstor.org

Gurevich, Yuri; Magidor, Menachem; Shelah, Saharon (1993). "The monadic theory of ω₂" (PDF). The Journal of Symbolic Logic. 48 (2): 387–398. doi:10.2307/2273556. JSTOR 2273556. S2CID 120260712.
Shelah, Saharon (Nov 1975). "Monadic theory of order" (PDF). Annals of Mathematics. 102 (3): 379–419. arXiv:2305.00968. doi:10.2307/1971037. JSTOR 1971037. S2CID 122129926.

logic.at

shelah.logic.at

Gurevich, Yuri; Magidor, Menachem; Shelah, Saharon (1993). "The monadic theory of ω₂" (PDF). The Journal of Symbolic Logic. 48 (2): 387–398. doi:10.2307/2273556. JSTOR 2273556. S2CID 120260712.
Shelah, Saharon (Nov 1975). "Monadic theory of order" (PDF). Annals of Mathematics. 102 (3): 379–419. arXiv:2305.00968. doi:10.2307/1971037. JSTOR 1971037. S2CID 122129926.

mathoverflow.net

"What is the Turing degree of the monadic theory of the real line?". MathOverflow. Retrieved November 14, 2022.

mccme.ru

"The generalization of Shelah–Stup theorem" (PDF). Retrieved November 14, 2022.

nyu.edu

cs.nyu.edu

Kołodziejczyk, Leszek (October 19, 2015). "Question on Decidability of S2S". FOM.

purdue.edu

docs.lib.purdue.edu

Siefkes, Dirk (1971), An axiom system for the weak monadic second order theory of two successors

semanticscholar.org

api.semanticscholar.org

Carayol, Arnaud; Löding, Christof (2007), "MSO on the Infinite Binary Tree: Choice and Order" (PDF), Computer Science Logic, Lecture Notes in Computer Science, vol. 4646, pp. 161–176, doi:10.1007/978-3-540-74915-8_15, ISBN 978-3-540-74914-1, S2CID 14580598
Das, Anupam; Riba, Colin (2020). "A functional (monadic) second-order theory of infinite trees". Logical Methods in Computer Science. 16 (4). arXiv:1903.05878. doi:10.23638/LMCS-16(4:6)2020. S2CID 76666389. (A preliminary 2015 version erroneously claimed proof of completeness without the determinacy schema.)
Gurevich, Yuri; Shelah, Saharon (1984). "The monadic theory and the "next world"". Israel Journal of Mathematics. 49 (1–3): 55–68. doi:10.1007/BF02760646. S2CID 15807840.
Gurevich, Yuri; Magidor, Menachem; Shelah, Saharon (1993). "The monadic theory of ω₂" (PDF). The Journal of Symbolic Logic. 48 (2): 387–398. doi:10.2307/2273556. JSTOR 2273556. S2CID 120260712.
Shelah, Saharon (Nov 1975). "Monadic theory of order" (PDF). Annals of Mathematics. 102 (3): 379–419. arXiv:2305.00968. doi:10.2307/1971037. JSTOR 1971037. S2CID 122129926.

springer.com

link.springer.com

Riba, Colin (2012). A model theoretic proof of completeness of an axiomatization of monadic second-order logic on infinite words (PDF). TCS 2012. doi:10.1007/978-3-642-33475-7_22.

ucla.edu

math.ucla.edu

Neeman, Itay (2008), "Monadic definability of ordinals" (PDF), Computational Prospects of Infinity, Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore, vol. 15, pp. 193–205, doi:10.1142/9789812796554_0010, ISBN 978-981-279-654-7