Prati
Alasdair Urquhart
Alasdair Urquhart
Professor Computer Science Emeritus, University of Toronto
Potvrđena adresa e-pošte na cs.toronto.edu
Naslov
Citirano
Citirano
Godina
Temporal logic
N Rescher, A Urquhart
Springer Science & Business Media, 2012
10672012
Hard examples for resolution
A Urquhart
Journal of the ACM (JACM) 34 (1), 209-219, 1987
6101987
Many-valued logic
A Urquhart
Handbook of Philosophical Logic: Volume III: Alternatives in Classical Logic …, 1986
449*1986
Semantics for relevant logics
A Urquhart
The Journal of Symbolic Logic 37 (1), 159-169, 1972
3571972
The complexity of propositional proofs
A Urquhart
Bulletin of Symbolic Logic 1 (4), 425-467, 1995
3161995
Functional interpretations of feasibly constructive arithmetic
S Cook, A Urquhart
Proceedings of the twenty-first annual ACM symposium on Theory of computing …, 1989
2271989
A topological representation theory for lattices
A Urquhart
Algebra Universalis 8, 45-58, 1978
2251978
The undecidability of entailment and relevant implication
A Urquhart
The Journal of Symbolic Logic 49 (4), 1059-1073, 1984
2041984
Distributive lattices with a dual homomorphic operation
A Urquhart
Studia Logica 38, 201-209, 1979
1441979
Upper and lower bounds for tree-like cutting planes proofs
R Impagliazzo, T Pitassi, A Urquhart
Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science, 220-228, 1994
1071994
Duality for algebras of relevant logics
A Urquhart
Studia Logica 56 (1), 263-276, 1996
811996
The symmetry rule in propositional logic
A Urquhart
Discrete Applied Mathematics 96, 177-193, 1999
711999
The complexity of decision procedures in relevance logic II
A Urquhart
The Journal of Symbolic Logic 64 (4), 1774-1802, 1999
691999
An exponential separation between regular and general resolution
M Alekhnovich, J Johannsen, T Pitassi, A Urquhart
Theory of Computing 3 (1), 81-102, 2007
662007
An exponential separation between regular and general resolution
M Alekhnovich, J Johannsen, T Pitassi, A Urquhart
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002
652002
Approximation and small-depth Frege proofs
S Bellantoni, T Pitassi, A Urquhart
SIAM Journal on Computing 21 (6), 1161-1179, 1992
621992
Decidability and the finite model property
A Urquhart
Journal of Philosophical Logic, 367-370, 1981
601981
Synonymous logics
FJ Pelletier, A Urquhart
Journal of Philosophical Logic 32, 259-285, 2003
582003
The complexity of decision procedures in relevance logic
A Urquhart
Truth or consequences: Essays in honor of Nuel Belnap, 61-76, 1990
571990
The complexity of the Hajós calculus
T Pitassi, A Urquhart
SIAM Journal on Discrete Mathematics 8 (3), 464-483, 1995
481995
Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.
Članci 1–20