Abstract
A fragment of classical predicate calculus which does not contain rules for contraction is defined. It is shown to be decidable and yet propositionally complete. A semantics which reflects its constructive character is developed.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
G. Boolos and R. Jeffrey. Computability and logic. Cambridge university press (1974)
J. Krajicek and P. Pudlak. The number of proof lines and the size of proofs in the first order logic. Archive for mathematical logic 27 (1988) 69–84
J. Ketonen, R. Weyhrauch. A decidable fragment of predicate calculus. Theoretical computer science (TCS) 32 (1984) 297–307
J-Y. Girard. Linear logic. TCS 50 (1987) 1–101
J-Y. Girard, Y. Lafont. Linear logic and lazy computation. Proceedings theory and practice of software development 1987 (H. Ehrig et al., editors). Lecture notes in computer science 250 (1987) 52–66
A. Avron. The semantics and proof theory of linear logic. TCS 57 (1988) 161–184
H. Ono and Y. Komori. Predicate logic without the structure rules. Studia logica 45 (1985) 393–404.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mey, D. (1990). A predicate calculus with control of derivations. In: Börger, E., Büning, H.K., Richter, M.M. (eds) CSL '89. CSL 1989. Lecture Notes in Computer Science, vol 440. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52753-2_44
Download citation
DOI: https://doi.org/10.1007/3-540-52753-2_44
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52753-4
Online ISBN: 978-3-540-47137-0
eBook Packages: Springer Book Archive