Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Huuskonen, T.
and
Hyttinen, T.
2001.
On definability of order in logic with choice.
p.
167.
Gurevich, Y.
2001.
Logician in the land of OS: abstract state machines in Microsoft.
p.
129.
Wirth, Claus-Peter
2002.
Automated Reasoning with Analytic Tableaux and Related Methods.
Vol. 2381,
Issue. ,
p.
298.
Omodeo, Eugenio G.
and
Schwartz, Jacob T.
2002.
Computational Logic: Logic Programming and Beyond.
Vol. 2408,
Issue. ,
p.
214.
Dawar, Anuj
and
Richerby, David
2003.
Computer Science Logic.
Vol. 2803,
Issue. ,
p.
169.
Rossman, B.
2003.
Successor-invariance in the finite.
p.
148.
Blass, Andreas
and
Gurevich, Yuri
2003.
Abstract state machines capture parallel algorithms.
ACM Transactions on Computational Logic,
Vol. 4,
Issue. 4,
p.
578.
Bournez, O.
Cucker, F.
de Jacobe Naurois, P.
and
Marion, J. -Y.
2004.
Exploring New Frontiers of Theoretical Informatics.
Vol. 155,
Issue. ,
p.
409.
Richerby, David
2004.
Computer Science Logic.
Vol. 3210,
Issue. ,
p.
370.
Seldin, Jonathan P.
2004.
Interpreting HOL in the calculus of constructions.
Journal of Applied Logic,
Vol. 2,
Issue. 2,
p.
173.
Moser, Georg
and
Zach, Richard
2006.
The Epsilon Calculus and Herbrand Complexity.
Studia Logica,
Vol. 82,
Issue. 1,
p.
133.
Bournez, Olivier
Cucker, Felipe
de Naurois, Paulin Jacobé
and
Marion, Jean-Yves
2006.
Implicit complexity over an arbitrary structure: Quantifier alternations.
Information and Computation,
Vol. 204,
Issue. 2,
p.
210.
Haghighi, Hassan
and
Mirian Hosseinabadi, Seyyed Hassan
2006.
An Approach to Nondeterminism in Translation of CZ Set Theory into Martin-Löf 's Theory of Types.
Electronic Notes in Theoretical Computer Science,
Vol. 159,
Issue. ,
p.
117.
Wirth, Claus-Peter
2008.
Hilbert's epsilon as an operator of indefinite committed choice.
Journal of Applied Logic,
Vol. 6,
Issue. 3,
p.
287.
Molnar, Z.
2013.
Epsilon-invariant substitutions and indefinite descriptions.
Logic Journal of IGPL,
Vol. 21,
Issue. 5,
p.
812.
Zach, Richard
2017.
Logic and Its Applications.
Vol. 10119,
Issue. ,
p.
27.
Dawar, Anuj
and
Pago, Benedikt
2024.
A Logic for P: Are we Nearly There Yet?.
ACM SIGLOG News,
Vol. 11,
Issue. 2,
p.
35.
Miyamoto, Kenji
and
Moser, Georg
2024.
Herbrand complexity and the epsilon calculus with equality.
Archive for Mathematical Logic,
Vol. 63,
Issue. 1-2,
p.
89.