Optimal proofs of determinacy II
Journal of Mathematical Logic 2 (02):227-258 (2002)
| Abstract | This article has no associated abstract. (fix it) | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,705 |
| External links |
|
| Through your library | Configure |
Itay Neeman (1995). Optimal Proofs of Determinacy. Bulletin of Symbolic Logic 1 (3):327-339.
Donald A. Martin, Itay Neeman & Marco Vervoort (2003). The Strength of Blackwell Determinacy. Journal of Symbolic Logic 68 (2):615-636.
Itay Neeman (2006). Determinacy for Games Ending at the First Admissible Relative to the Play. Journal of Symbolic Logic 71 (2):425 - 459.
Derrick Albert Dubose (1990). The Equivalence of Determinacy and Iterated Sharps. Journal of Symbolic Logic 55 (2):502-525.
Kai Hauser & W. Hugh Woodin (1999). Π13 Sets and Π13 Singletons. Journal of Symbolic Logic 64 (2):590 - 616.
Derrick Albert Dubose (1995). Determinacy and the Sharp Function on Objects of Type K. Journal of Symbolic Logic 60 (4):1025-1053.
Kenny Easwaran (2009). Probabilistic Proofs and Transferability. Philosophia Mathematica 17 (3):341-362.
John F. Post (1984). On the Determinacy of Valuation. Philosophical Studies 45 (May):315-33.
Brian Bix (2003). Can Theories of Meaning and Reference Solve the Problem of Legal Determinacy? Ratio Juris 16 (3):281-295.
Mareike B. Wieth & Rose T. Zacks (2011). Time of Day Effects on Problem Solving: When the Non-Optimal is Optimal. Thinking and Reasoning 17 (4):387 - 401.
Jan Krajíček (1995). Bounded Arithmetic, Propositional Logic, and Complexity Theory. Cambridge University Press.
David Sherry (2009). The Role of Diagrams in Mathematical Arguments. Foundations of Science 14 (1-2):59-74.
Maria Bonet, Toniann Pitassi & Ran Raz (1997). Lower Bounds for Cutting Planes Proofs with Small Coefficients. Journal of Symbolic Logic 62 (3):708-728.
Diego Rojas-Rebolledo (2012). Bounds on the Strength of Ordinal Definable Determinacy in Small Admissible Sets. Notre Dame Journal of Formal Logic 53 (3):351-371.
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2012-09-02Total downloads0Recent downloads (6 months)0How can I increase my downloads? |

