One-and-a-halfth-order Logic

Journal of Logic and Computation

Volumn 18, Issue 4, 2008, Pages 521-562

  Gabbay, Murdoch J ^a   Mathijssen, Aad ^b  

^a HERIOT WATT UNIVERSITY   (United Kingdom)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

conversion; First order logic; Meta variables; Nominal techniques; Substitution

Indexed keywords

ALGEBRA; BOOLEAN ALGEBRA; FORMAL LOGIC; MATRIX ALGEBRA; SPECIFICATIONS;

ALGEBRAIC SPECIFICATIONS; ALPHA-EQUIVALENCE; CUT ELIMINATION; FIRST ORDER LOGIC (FOL); META LEVELS;

FUZZY LOGIC;

EID: 47849085020     PISSN: 0955792X     EISSN: 1465363X     Source Type: Journal    
DOI: 10.1093/logcom/exm064     Document Type: Article

References (46)

1. H. Andréka, I. Németi and I. Sain. Algebraic logic. In Handbook of Philosophical Logic, 2nd Edition, D. Gabbay and F. Guenthner, eds., vol. 2, pp. 133-249. Kluwer Academic, Dordrecht, 2001.
2. J. Barwise. Admissible Sets and Structures: An Approach to Definability Theory. Perspectives in Mathematical Logic. Springer, Berlin, 1975.
3. J. Barwise. An introduction to first-order logic. In Handbook of Mathematical Logic, J. Barwise, ed., pp. 5-46. North Holland, Amsterdam, 1977.
4. M. Beeson. Lambda logic. In IJCAR 2004: The 2nd International Joint Conference on Automated Reasoning. Vol. 3097 of LNCS, pp. 460-474. Springer, Berlin, 2004.
5. J. Bell and M. Machover. A Course in Mathematical Logic. North-Holland, Amsterdam, 1977.
6. N. Brunner. 75 years of independence proofs by Fraenkel-Mostowski permutation models. Mathematica Japonica, 43, 177-199, 1996.
7. S. Burris and H. Sankappanavar. A Course in Universal Algebra. Springer, Berlin, 1981.
8. B. Courcelle. The expression of graph properties in some fragments of monadic secondorder logic. In Handbook of Graph Grammars and Computing by Graph Transformations, G. Rozenberg, editor, vol. 1, pp. 313-400. World Scientific, London, 1997.
9. A. Degtyarev and A. Voronkov. Equality reasoning in sequent-based calculi. In Handbook of Automated Reasoning, J. A. Robinson and A. Voronkov, eds., pp. 611-706. Elsevier, Amsterdam, MIT Press, Cambridge, USA, 2001.
10. G. Dowek, T. Hardin and C. Kirchner. Binding logic: Proofs and models. In LPAR'02: 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, Vol. 2514 of LNCS, pp. 130-144, Springer, Berlin, 2002.
11. M. Dunn and G. Restall. Relevance logic. In Handbook of Philosophical Logic, 2nd Edition, D. Gabbay and F. Guenthner, eds., vol. 6, pp. 1-128. Kluwer Academic, Dordrecht, 2002.
12. W. M. Farmer. The seven virtues of simple type theory. Technical Report 18, McMaster University, SQRL, 2003 (revised 2006).
13. M. Fernández and M. J. Gabbay. Nominal rewriting. Information and Computation, 205, 917-965, 2007.
14. D. Gabbay and G. Malod. Naming worlds in modal and temporal logic. Journal of Logic, Language and Information, 11, 29-65, 2002.
15. M. J. Gabbay. A Theory of Inductive Definitions with alpha-Equivalence. PhD thesis, Cambridge, UK, 2000.
16. M. J. Gabbay. Hierarchical nominal terms and their theory of rewriting. ENTCS, 174, 37-52, 2007.
17. M. J. Gabbay and S. Lengrand. The lambda-context calculus. In LFMTP'07: International Workshop on Logical Frameworks and Meta-Languages, to be published in ENTCS.
18. M. J. Gabbay and A. Mathijssen. Capture-avoiding substitution as a nominal algebra. In Theoretical Aspects of Computing ICTAC 2006. Vol. 4281 of LNCS, pp. 198-212, Springer, Berlin.
19. M. J. Gabbay and A. Mathijssen. Nominal algebra. Technical Report HW-MACS-TR-0045, Heriot-Watt, 2006.
20. M. J. Gabbay and A. Mathijssen. Capture-avoiding substitution as a nominal algebra. Technical Report HW-MACS-TR-0053, Heriot-Watt, 2007.
21. M. J. Gabbay and A. Mathijssen. A formal calculus for informal equality with binding. In WoLLIC'07:14th Workshop on Logic, Language, Information and Computation. Vol. 4576 of LNCS, pp. 162-176, Springer, Berlin, 2007.
22. M. J. Gabbay and A. M. Pitts. A new approach to abstract syntax with variable binding. Formal Aspects of Computing, 13, 341-363, 2002.
23. G. Gentzen. Untersuchungen über das logische schließen [Investigations into logical deduction]. Mathematische Zeitschrift 39, pp. 176-210,405-431, 1935. Translated in [43], pp. 68-131.
24. J.-Y. Girard. Linear logic. Theoretical Computer Science, 50, 1-102, 1987.
25. P. Halmos. Algebraic logic, ii. homogeneous locally finite polyadic boolean algebras of infinite degree. Fundamenta Mathematicae, 43, 255-325, 1956.
26. L. Henkln, J. Monk and A. Tarski. Cylindric Algebras. Parts I and II. North Holland, Amsterdam, 1971 and 1985.
27. W. Hodges. Elementary predicate logic. In Handbook of Philosophical Logic, 2nd Edition, D. Gabbay and F. Guenthner, eds., vol. 1, pp. 1-131. Kluwer Academic, Dordrecht, 2001.
28. G. Huet, G. Kahn and C. Paulin-Mohring. The Coq proof assistant, a tutorial. http://coq.inria.fr/V8.1/tutorial.html
29. P. Johnstone. Notes on logic and set theory. Cambridge University Press, Cambridge, 1987.
30. D. Leivant. Higher order logic. In Handbook of Logic in Artificial Intelligence and Logic Programming, D. Gabbay, C. Hogger and J. Robinson, eds., vol. 2, pp. 229-322. Oxford University Press, Oxford, 1994.
31. W. McCune, R. Veroff, B. Fitelson, K. Harris, A. Feist and L. Wos. Short single axioms for boolean algebra. Journal of Automated Reasoning, 29, 1-16, 2002.
32. C. Meredith. Single axioms for the systems (C, N), (C, O) and (A, N) of the two-valued propositions calculus. The Journal of Computing Systems, 3, 155-164, 1953.
33. Metamath.org. Derivation of classical prepositional logic from Meredith's axiom. http://us.metamath.org/mpegif/meredith.html
34. M. Miculan. Developing (meta)theory of lambda-calculus in the theory of contexts. ENTCS, 58, pp. 37-58, 2001.
35. D. Miller. A logic programming language with lambda-abstraction, function variables, and simple unification. Extensions of Logic Programming, 475, 253-281, 1991.
36. P. W. O'Hearn and D. J. Pym. The logic of bunched implications. Bulletin of Symbolic Logic, 5, 215-244, 1999.
37. L. C. Paulson. The foundation of a generic theorem prover. Journal of Automated Reasoning, 5, 363-397, 1989.
38. L. C. Paulson. Isabelle: the next 700 theorem, provers. In Logic and Computer Science, P. Odifreddi, ed., pp. 361-386. Academic Press, London, 1990.
39. F. Pfenning and C. Elliot. Higher-order abstract syntax. In PLDI '88: Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation, pp. 199-208. ACM Press, New York, 1988.
40. C. Pinter. A simple algebra of first-order logic. Notre Dame Journal of Formal Logic, 14, 361-366, 1973.
41. D. Prawitz. Natural Deduction: A Proof Theoretical Study. Almqvist and Wiksell, Stockholm, 1965.
42. S. Shapiro. Systems between first-order and second-order logics. In Handbook of Philosophical Logic, 2nd. Edition, D. Gabbay and F. Guenthner, eds., vol. 1, pp. 131-188. Kluwer Academic, Dordrecht, 2001.
43. M. Szabo, ed. Collected Papers of Gerhard Gentzen. North. Holland, Amsterdam, 1969.
44. C. Urban, A. M. Pitts and M. J. Gabbay. Nominal unification. Theoretical Computer Science, 323, 473-497, 2004.
45. J. van Benthem, Higher-order logic. In D. Gabbay and F. Guenthner, editors, Handbook of Philosophical, Logic, 2nd Edition, vol. 1, pp. 189-244. Kluwer Academic, Dordrecht, 2001.
46. D. van Dalen. Intuitionistic logic. In Handbook of Philosophical Logic, 2nd Edition, D. Gabbay and F. Guenthner, eds., vol. 5, pp. 1-114. Kluwer Academic, Dordrecht, 2002.