A simple irredundance test for tautological sequents
Erkenntnis 46 (2):175-183 (1997)
| Abstract | This article has no associated abstract. (fix it) | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | No categories specified (fix it) | |||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,679 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesStuart M. Shieber (2007). The Turing Test as Interactive Proof. Noûs 41 (4):686–713.
Tim Mulgan (2001). A Minimal Test for Political Theories. Philosophia 28 (1-4):283-296.
Bruce M. Kapron (1987). Modal Sequents and Definability. Journal of Symbolic Logic 52 (3):756-762.
J. Donald Monk (2008). Maximal Irredundance and Maximal Ideal Independence in Boolean Algebras. Journal of Symbolic Logic 73 (1):261-275.
Erik Aarts (1994). Proving Theorems of the Second Order Lambek Calculus in Polynomial Time. Studia Logica 53 (3):373 - 387.
Benny Shanon (1989). A Simple Comment Regarding the Turing Test. Journal for the Theory of Social Behaviour 19 (June):249-56.
Robert French (1996). The Inverted Turing Test: How a Mindless Program Could Pass It. Psycoloquy 7 (39).
Kosta Došen (1985). Sequent-Systems for Modal Logic. Journal of Symbolic Logic 50 (1):149-168.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2009-01-28Total downloads0Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
