Temporal Logic and State Systems, Series: Texts in Theoretical Computer Science Fred Kröger Stephan Merz

Authors: Goranko, Valentin

Source: Studia Logica: An International Journal for Symbolic Logic, 2010 Apr 01. 94(3), 443-445.

Relation: Temporal Logic and State Systems, Series: Texts in Theoretical Computer Science Fred Kröger Stephan Merz

Access URL: https://www.jstor.org/stable/40587204

J. Flum and M. Grohe. Parameterized complexity theory. Texts in Theoretical Computer Science. Springer, Berlin, 2006, xiii + 493 pp

Authors: Thomas Schwentick

Source: Bulletin of Symbolic Logic. 13:246-248

Subject Terms: 0101 mathematics, 01 natural sciences

Access URL: https://www.cambridge.org/core/journals/bulletin-of-symbolic-logic/article/j-flum-and-m-grohe-parameterized-complexity-theory-texts-in-theoretical-computer-science-springer-berlin-2006-xiii-493-pp/20E7DD0381A916ABB0AF6672998DC4F3

Finite model theory and its applications. Texts in Theoretical Computer Science E. Grädel P. G. Kolaitis L. Libkin M. Marx J. Spencer M. Y. Vardi Y. Venema S. Weinstein

Authors: Kreutzer, Stephan

Source: The Bulletin of Symbolic Logic, 2010 Sep 01. 16(3), 406-407.

Relation: Finite model theory and its applications. Texts in Theoretical Computer Science E. Grädel P. G. Kolaitis L. Libkin M. Marx J. Spencer M. Y. Vardi Y. Venema S. Weinstein

Access URL: https://www.jstor.org/stable/20749623

E. Grädel, P.G. Kolaitis, L. Libkin, M. Marx, J. Spencer, M.Y. Vardi, Y. Venema and S. Weinstein. Finite model theory and its applications. Texts in Theoretical Computer Science. Springer, Berlin, 2007, xiii + 437 pp

Authors: Stephan Kreutzer

Source: The Bulletin of Symbolic Logic. 16:406-407

Subject Terms: 0101 mathematics, 01 natural sciences

Access URL: https://www.cambridge.org/core/services/aop-cambridge-core/content/view/S1079898600000846

Juraj Hromkovic Design and Analysis of Randomized Algorithms: Introduction to Design Paradigms. Series: Texts in Theoretical Computer Science. An EATCS Series. Springer (2005). ISBN 3-540-23949-9. £30.50/€39.95/$49.95. 274 pp. Hardbound

Authors: Mark Burgin

Source: The Computer Journal. 49:249-250

Subject Terms: 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Access URL: https://academic.oup.com/comjnl/article/49/2/249/436575/Juraj-Hromkovic-Design-and-Analysis-of-Randomized

Yves Bertot and Pierre Casteran Interactive Theorem Proving and Program Development (Coq'Art: The Calculus of Inductive Constructions). Texts in Theoretical Computer Science. An EATCS Series. (2004). ISBN 3-540-20854-2. 469pp. Hardcover

Authors: Iman Poernomo

Source: The Computer Journal. 49:130-131

Subject Terms: 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Access URL: https://academic.oup.com/comjnl/article/49/1/130/418995

Verification of Reactive Systems: Formal Methods and Algorithms. By Klaus Schneider. Published by Springer, Berlin, Germany, Texts in Theoretical Computer Science Series, 2004. ISBN: 3-540-00296-0, pp 600

Authors: Joël Ouaknine

Source: Software Testing, Verification and Reliability. 15:202-203

Subject Terms: 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Access URL: https://onlinelibrary.wiley.com/doi/pdfdirect/10.1002/stvr.330
http://onlinelibrary.wiley.com/doi/10.1002/stvr.330/pdf
https://dblp.uni-trier.de/db/journals/stvr/stvr15.html#Ouaknine05
https://onlinelibrary.wiley.com/doi/pdf/10.1002/stvr.330
https://onlinelibrary.wiley.com/doi/abs/10.1002/stvr.330

E. Grädel, P.G. Kolaitis, L. Libkin, M. Marx, J. Spencer, M.Y. Vardi, Y. Venema and S. Weinstein. Finite model theory and its applications. Texts in Theoretical Computer Science. Springer, Berlin, 2007, xiii + 437 pp.

Authors: Kreutzer, Stephan, primary

Source: The Bulletin of Symbolic Logic. 2010/09/01

J. Flum and M. Grohe. Parameterized complexity theory. Texts in Theoretical Computer Science. Springer, Berlin, 2006, xiii + 493 pp.

Authors: Schwentick, Thomas, primary

Source: Bulletin of Symbolic Logic. 2007/06/01

Juraj Hromkovic Design and Analysis of Randomized Algorithms: Introduction to Design Paradigms. Series: Texts in Theoretical Computer Science. An EATCS Series. Springer (2005). ISBN 3-540-23949-9. £30.50/€39.95/$49.95. 274 pp. Hardbound.

Authors: Burgin, Mark, primary

Source: The Computer Journal. 2005/11/29

Yves Bertot and Pierre Casteran Interactive Theorem Proving and Program Development (Coq'Art: The Calculus of Inductive Constructions). Texts in Theoretical Computer Science. An EATCS Series. (2004). ISBN 3-540-20854-2. 469pp. Hardcover.

Authors: Poernomo, Iman Hafiz, primary

Source: The Computer Journal. 2005/11/03

Verification of Reactive Systems: Formal Methods and Algorithms. By Klaus Schneider. Published by Springer, Berlin, Germany, Texts in Theoretical Computer Science Series, 2004. ISBN: 3-540-00296-0, pp 600.

Authors: Ouaknine, Joël, primary

Source: Software Testing, Verification and Reliability. 2005/01/01

Access URL: https://onlinelibrary.wiley.com/doi/pdfdirect/10.1002/stvr.330

On Programmatic Aspects of the Universality, Parameter, and Recursion Theorems of Classical Computability.

Authors: Kulyukin, Vladimir A.

Source: Mathematics (2227-7390); Jul2025, Vol. 13 Issue 13, p2090, 24p

Subject Terms: RECURSION theory, MATHEMATICAL logic, PROOF theory, PROGRAMMING languages

Bisimilar and Logically Equivalent Programs in PDL

Authors: Benevides, Mario R.F. ¹

Source: In Electronic Notes in Theoretical Computer Science 11 July 2014 305:5-18

Application of AI to formal methods — an analysis of current trends.

Authors: Stock, Sebastian, Dunkelau, Jannik, Mashkoor, Atif

Source: Empirical Software Engineering; Dec2025, Vol. 30 Issue 6, p1-48, 48p

Position Paper: Thoughts on Programming with Proof Assistants

Authors: Chlipala, Adam

Source: In Electronic Notes in Theoretical Computer Science 4 June 2007 174(7):17-21

Twin-Width IV: Ordered Graphs and Matrices.

Authors: Bonnet, Édouard, Giocanti, Ugo, de Mendez, Patrice Ossona, Simon, Pierre, Thomassé, Stéphan, Toruńczyk, Szymon

Source: Journal of the ACM; Jun2024, Vol. 71 Issue 3, p1-45, 45p

Subject Terms: FINITE model theory, GRAPH theory, APPROXIMATION algorithms, FIRST-order logic, MODEL theory

Applications of random algebraic constructions to hardness of approximation.

Authors: Bukh, Boris, Karthik, C. S., Narayanan, Bhargav

Source: Israel Journal of Mathematics; Sep2025, Vol. 268 Issue 1, p1-43, 43p

LEARNING CONCEPTS DEFINABLE IN FIRST-ORDER LOGIC WITH COUNTING.

Authors: VAN BERGEREM, STEFFEN

Source: Logical Methods in Computer Science (LMCS); 2025, Vol. 21 Issue 3, p1-40, 40p

Subject Terms: FIRST-order logic, MACHINE learning, COMPUTATIONAL complexity, MATHEMATICAL logic, PREDICATE (Logic)

Computability of pressure for subshifts on countable amenable groups.

Authors: Hedges, C Evans, Pavlov, Ronnie

Source: Nonlinearity; Jul2025, Vol. 38 Issue 7, p1-22, 22p

Subject Terms: ENTROPY (Information theory), ALGORITHMS, DYNAMICAL systems, RECURSION theory, UNCERTAINTY (Information theory)