Abstract
A subsystem of Kripke-Platek set theory proof-theoretically equivalent to primitive recursive arithmetic is isolated; Aczel's (relative) consistency argument for the Anti-Foundation Axiom is adapted to a (related) weak setting; and the logical complexity of the largest bisimulation is investigated.
The author is gratefully indebted to Prof. S. Feferman for supervision, to CWI for refuge, and to the Netherlands Organization for the Advancement of Research (project NF 102/62-356, ‘Structural and Semantic Parallels in Natural Languages and Programming Languages’) for funding.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Samson Abramsky. Topological aspects of non-well-founded sets. Handwritten notes.
Peter Aczel. An introduction to inductive definitions. In J. Barwise, editor. Handbook of Mathematical Logic. North-Holland, Amsterdam, 1977.
Peter Aczel. The type-theoretic interpretation of constructive set theory. In Logic Colloquium '77. North-Holland, Amsterdam, 1978.
Peter Aczel. Non-well-founded sets. CSLI Lecture Notes Number 14, Stanford, 1988.
Jon Barwise. Admissible sets and structures. Springer-Verlag, Berlin, 1975.
Jon Barwise and John Etchemendy. The liar: an essay on truth and circularity. Oxford University Press, Oxford, 1987.
Solomon Feferman. Predicatively reducible systems of set theory. In Proc. Symp. Pure Math., vol 13, Part II. Amer. Math. Soc., Providence, R.I., 1974.
Solomon Feferman. A language and axioms for explicit mathematics. In J.N. Crossley, editor, Algebra and Logic, LNM 450. Springer-Verlag, Berlin, 1975.
Solomon Feferman. Hilbert's program relativized: proof-theoretical and foundational reductions. Journal of Symbolic Logic, 53(2), 1988.
Tim Fernando. Transition systems over first-order models. Manuscript, 1991.
Tim Fernando. Parallelism, partial execution and programs as relations on states. Manuscript, 1992.
Gerhard Jäger. A version of Kripke-Platek set theory which is conservative over Peano arithmetic. Zeitschr. f. math. Logik und Grundlagen d. Math, 30, 1984.
Gerhard Jäger. Induction in the elementary theory of types and names. Preprint, 1988.
R.B. Jensen and C. Karp. Primitive recursive set functions. In Proc. Symp. Pure Math., vol 13, Part I. Amer. Math. Soc., Providence, R.I., 1971.
Ingrid Lindström. A construction of non-well-founded sets within Martin-Löf 's type theory. Journal of Symbolic Logic, 54, 1989.
M. Mislove, L. Moss, and F. Oles. Non-well-founded sets obtained from ideal fixed points. In Fourth annual symposium on Logic in Computer Science, 1989.
Charles Parsons. On a number-theoretic choice schema and its relation to induction. In J. Myhill, editor, Intuitionism and Proof Theory. North-Holland, Amsterdam, 1970.
Alban Ponse. Computable processes and bisimulation equivalence. Technical Report CS-R9207, Centre for Mathematics and Computer Science, 1992.
J.J.M.M. Rutten. Non-well-founded sets and programming language semantics. Technical Report CS-R9063, Centre for Mathematics and Computer Science, 1990.
J.J.M.M. Rutten. Hereditarily finite sets and complete metric spaces. Technical Report CS-R9148, Centre for Mathematics and Computer Science, 1991.
Wilfried Sieg. Fragments of arithmetic. Annals of Pure and Applied Logic, 28, 1985.
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fernando, T. (1992). A primitive recursive set theory and AFA: On the logical complexity of the largest bisimulation. In: Börger, E., Jäger, G., Kleine Büning, H., Richter, M.M. (eds) Computer Science Logic. CSL 1991. Lecture Notes in Computer Science, vol 626. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023760
Download citation
DOI: https://doi.org/10.1007/BFb0023760
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55789-0
Online ISBN: 978-3-540-47285-8
eBook Packages: Springer Book Archive