Book contents
- Frontmatter
- Contents
- Preface
- Participants Photograph
- Generic absoluteness for Σ1 formulas and the continuum problem
- Axioms of generic absoluteness
- Generalised dynamic ordinals — universal measures for implicit computational complexity
- The Worm principle
- “One is a lonely number”: logic and communication
- Computable versions of the uniform boundedness theorem
- Symmetry of the universal computable function: A study of its automorphisms, homomorphisms and isomorphic embeddings
- PCF theory and Woodin cardinals
- Embedding finite lattices into the computably enumerable degrees — a status survey
- Dimension theory inside a homogeneous model
- Reals which compute little
- Bisimulation invariance and finite models
- Choice principles in constructive and classical set theories
- Ash's theorem for abstract structures
- Martin-Löf random and PA-complete sets
- Learning and computing in the limit
- References
Bisimulation invariance and finite models
Published online by Cambridge University Press: 31 March 2017
By
Book contents
- Frontmatter
- Contents
- Preface
- Participants Photograph
- Generic absoluteness for Σ1 formulas and the continuum problem
- Axioms of generic absoluteness
- Generalised dynamic ordinals — universal measures for implicit computational complexity
- The Worm principle
- “One is a lonely number”: logic and communication
- Computable versions of the uniform boundedness theorem
- Symmetry of the universal computable function: A study of its automorphisms, homomorphisms and isomorphic embeddings
- PCF theory and Woodin cardinals
- Embedding finite lattices into the computably enumerable degrees — a status survey
- Dimension theory inside a homogeneous model
- Reals which compute little
- Bisimulation invariance and finite models
- Choice principles in constructive and classical set theories
- Ash's theorem for abstract structures
- Martin-Löf random and PA-complete sets
- Learning and computing in the limit
- References
- Type
- Chapter
- Information
- Logic Colloquium '02 , pp. 276 - 298Publisher: Cambridge University PressPrint publication year: 2006
References
[1] , Tools from higher algebra Handbook of Combinatorics ( et al., editors), vol. II, North-Holland, 1995, pp. 1749–1783.
[2] , , and , Modal languages and bounded fragments of predicate logic Journal of Philosophical Logic, vol. 27 (1998), pp. 217–274.
[3] and , Interpolation, preservation, and pebble games The Journal of Symbolic Logic, vol. 64 (1999), pp. 881–903.
[4] , Cubic graphs with large girth Annals of the New York Academy of Sciences ( et al., editors), vol. 555, New York Acad. Sci., New York, 1989, pp. 56–62.
[5] and , Modal characterisation theorems over special classes of frames Proceedings of 20th Annual IEEE Symposium on Logic in Computer Science LICS'05, 2005, pp. 21–30.
[6] and , Finite Model Theory, 2nd ed., Springer, Berlin, 1999.
[7] , , and , Mathematical Logic, Springer, New York, 1994.
[8] , On local and nonlocal properties Logic Colloquium '81 (J. Stern, editor), North Holland, Amsterdam, 1982, pp. 105–135.
[9] , Why are modal logics so robustly decidable? Bulletin of the European Association for Theoretical Computer Science, vol. 68 (1999), pp. 90–103.
[10] and , On logics with two variables Theoretical Computer Science, vol. 224 (1999), pp. 73–113.
[11] and , Algebraic laws of indeterminism and concurrency Journal of the ACM, vol. 32 (1985), pp. 137–162.
[12] and , Finite conformal hypergraph covers and Gaifman cliques in finite structures The Bulletin of Symbolic Logic, vol. 9 (2003), pp. 387–405.
[13] , Explicit construction of regular graphs without small cycles Combinatorica, vol. 4 (1984), pp. 53–59.
[14] and , On the expressive completeness of the propositional mucalculus with respect to monadic second order logic Proceedings of 7th International Conference on Concurrency Theory CONCUR '96, Lecture Notes in Computer Science, vol. 1119, Springer-Verlag, Berlin, 1996, pp. 263–277.
[15] , Graphs without short cycles Combinatorica, vol. 2 (1982), pp. 71–78.
[16] , Bounded Variable Logics and Counting, Lecture Notes in Logic, vol. 9, Springer, Berlin, 1997.
[17] , Modal and guarded characterisation theorems over finite transition systems Proceedings of 17th Annual IEEE Symposium on Logic in Computer Science LICS '02, 2002, pp. 371–380.
[18] , An elementary proof of the van Benthem–Rosen characterisation theorem, TUD online preprint no. 2342, 2004.
[19] , Modal and guarded characterisation theorems over finite transition systems Annals of Pure and Applied Logic, vol. 130 (2004), pp. 173–205, extended journal version of [17].
[20] , Concurrency and automata on infinte sequences Proceedings of 5th GI Conference, Springer-Verlag, 1981, pp. 176–183.
[21] , A Course in Model Theory, Springer-Verlag, New York, 2000.
[22] , Modal logic over finite structures Journal of Logic, Language and Information, vol. 6 (1997), pp. 427–439.
[23] , Modal Correspondence Theory, Ph.D. thesis, University of Amsterdam, 1976.
[24] , Modal Logic and Classical Logic, Bibliopolis, Napoli, 1983.
[25] , Why is modal logic so robustly decidable? Descriptive Complexity and Finite Models (, , and , editors), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 31, AMS, Providence, 1997, pp. 149–184.Google Scholar
- 5
- Cited by