Year |
Citation |
Score |
2010 |
Urquhart A. Von Neumann, Gödel and complexity theory The Bulletin of Symbolic Logic. 16: 516-530. DOI: 10.2178/Bsl/1294171130 |
0.351 |
|
2010 |
Čačić V, Pudlák P, Restall G, Urquhart A, Visser A. Decorated linear order types and the theory of concatenation Logic Group Preprint Series. 258. DOI: 10.1017/Cbo9780511778421.003 |
0.304 |
|
2010 |
Urquhart A. Anderson and Belnap's invitation to sin Journal of Philosophical Logic. 39: 453-472. DOI: 10.1007/S10992-010-9135-5 |
0.313 |
|
2008 |
Kremer P, Urquhart A. Supervaluation fixed-point logics of truth Journal of Philosophical Logic. 37: 407-440. DOI: 10.1007/S10992-007-9071-1 |
0.306 |
|
2008 |
Pelletier FJ, Urquhart A. Synonymous logics: A correction Journal of Philosophical Logic. 37: 95-100. DOI: 10.1007/S10992-007-9062-2 |
0.303 |
|
2007 |
Urquhart A. Shawn Hedman. A first course in logic: an introduction to model theory, proof theory, computability, and complexity . Oxford Texts in Logic 1. Oxford University Press, 2004, xx + 431 pp. The Bulletin of Symbolic Logic. 13: 538-540. DOI: 10.2178/Bsl/1203350881 |
0.331 |
|
1999 |
Urquhart A. The symmetry rule in prepositional logic Discrete Applied Mathematics. 96: 177-193. DOI: 10.1016/S0166-218X(99)00039-6 |
0.31 |
|
1996 |
Urquhart A. Duality for algebras of relevant logics Studia Logica. 56: 263-276. DOI: 10.1007/Bf00370149 |
0.356 |
|
1995 |
Pitassi T, Urquhart A. The Complexity of the Hajos Calculus Siam Journal On Discrete Mathematics. 8: 464-483. DOI: 10.1137/S089548019224024X |
0.313 |
|
1993 |
Cook S, Urquhart A. Functional interpretations of feasibly constructive arithmetic Annals of Pure and Applied Logic. 63: 103-200. DOI: 10.1016/0168-0072(93)90044-E |
0.329 |
|
1992 |
Bellantoni S, Pitassi T, Urquhart A. Approximation and small-depth Frege proofs Siam Journal On Computing. 21: 1161-1179. DOI: 10.1137/0221068 |
0.316 |
|
1989 |
Urquhart A. Dunn J. Michael. Relevant predication I: the formal theory, Journal of philosophical logic , vol. 16 (1987), pp. 347–381. Journal of Symbolic Logic. 54: 615-616. DOI: 10.2307/2274874 |
0.325 |
|
1989 |
Urquhart A. The complexity of Gentzen systems for propositional logic Theoretical Computer Science. 66: 87-97. DOI: 10.1016/0304-3975(89)90147-3 |
0.331 |
|
1988 |
Meyer RK, Martin EP, Giambrone S, Urquhart A. Further Results on Proof Theories For Semilattice Logics Mathematical Logic Quarterly. 34: 301-304. DOI: 10.1002/Malq.19880340404 |
0.317 |
|
1974 |
Urquhart A. Proofs, Snakes and Ladders Dialogue. 13: 723-731. DOI: 10.1017/S0012217300030250 |
0.303 |
|
Show low-probability matches. |