A general mathematics of names

Information and Computation

Volumn 205, Issue 7, 2007, Pages 982-1011

  Gabbay, Murdoch J ^a  

^a HERIOT WATT UNIVERSITY   (United Kingdom)

Author keywords

Alpha conversion; Fraenkel Mostowski set theory; Names; NEW quantifier; Nominal techniques; Set theory

Indexed keywords

SET THEORY; TREES (MATHEMATICS);

ALPHA-CONVERSION; FRAENKEL-MOSTOWSKI SET THEORY; NAMES; NEW QUANTIFIERS; NOMINAL TECHNIQUES;

SYNTACTICS;

EID: 84855201343     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2006.10.010     Document Type: Article

References (23)

1. M. J. Gabbay, A Theory of Inductive Definitions with Alpha-equivalence, Ph. D. thesis, Cambridge, UK (2000).
2. M. J. Gabbay, A. M. Pitts, A new approach to abstract syntax with variable binding, Formal Aspects of Computing 13(2001) 341-363. (Pubitemid 41204157)
3. J. Bell, M. Machover, A Course in Mathematical Logic, North-Holland, 1977.
4. P. T. Johnstone, Notes on Logic and Set Theory, Cambridge University Press, 1987.
5. M. R. Shinwell, A. M. Pitts, On a monadic semantics for freshness, Theoretical Computer Science 342(2005) 28-55. (Pubitemid 41162454)
6. N. G. de Bruijn, Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the church-rosser theorem, Indagationes Mathematicae 5(34) (1972) 381-392.
7. J. Barwise, An introduction to first-order logic, in: J. Barwise (Ed.), Handbook of Mathematical Logic, North Holland, 1977, pp. 5-46.
8. D. van Dalen, Intuitionistic logic, in: D. Gabbay, F. Guenthner (Eds.), Handbook of Philosophical Logic, Kluwer, 2002, pp. 1-114, Volume 5.
9. J. B. Fraleigh, A First Course in Abstract Algebra, Addison-Wesley, 1994.
10. L. C. Paulson, A fixedpoint approach to implementing (co) inductive definitions, in: CADE-12: Proceedings of the 12th International Conference on Automated Deduction, Springer-Verlag, London, UK, 1994, pp. 148-161.
11. J. Truss, Permutations and the axiom of choice, in: H. R. Kaye (Ed.), Automorphisms of First Order Structures, OUP, 1994, pp. 131-152.
12. H. P. Barendregt, The Lambda Calculus: its Syntax and Semantics (revised ed.), Vol. 103 of Studies in Logic and the Foundations of Mathematics, North-Holland, 1984. Available from http://www.andrew.cmu.edu/user/cebrown/ notes/barendregt%.html.
13. J. McKinna, R. Pollack, Some lambda calculus and type theory formalized, Journal of Automated Reasoning 23 (3-4) (1999) 373-409. (Pubitemid 30517164)
14. M. J. Gabbay, The π-calculus in FM, in: F. Kamareddine (Ed.), Thirty-Five Years of Automath, Kluwer, 2003, pp. 80-149.
15. M. J. Gabbay, Fresh graphs, submitted (November 2003).
16. M. J. Gabbay, A. M. Pitts, A new approach to abstract syntax involving binders, in: 14th Annual Symposium on Logic in Computer Science, IEEE Computer Society Press, Washington, 1999, pp. 214-224.
17. K. Gödel, On formally undecidable propositions in principia mathematica and related systems I, available online in translation by Martin Hirzel (1931).
18. N. Brunner, 75 years of independence proofs by Fraenkel-Mostowski permutation models (1996).
19. K. Kunen, Set Theory: An Introduction to Independence Proofs (Studies in Logic and the Foundations of Mathematics), Elsevier, 1980.
20. A. M. Pitts, Nominal logic, a first order theory of names and binding, Information and Computation 186(2003) 165-193.
21. M. R. Shinwell, A. M. Pitts, M. J. Gabbay, FreshML: programming with binders made simple, in: Eighth ACM SIGPLAN International Conference on Functional Programming (ICFP 2003), ACM Press, Uppsala, Sweden, 2003, pp. 263-274.
22. R. Milner, J. Parrow, D. Walker, A calculus of mobile processes, II, Information and Computation 100(1) (1992) 41-77.
23. U. Montanari, M. Pistore, History-dependent automata, Tech. Rep. TR-98-11, University of Pisa (5, 1998).