Abstract
Team logic is a new logic, introduced by Väänänen [1], extending dependence logic by classical negation. Dependence logic adds to first-order logic atomic formulas expressing functional dependence of variables on each other. It is known that on the level of sentences dependence logic and team logic are equivalent with existential second-order logic and full second-order logic, respectively. In this article we show that, in a sense that we make explicit, team logic and second-order logic are also equivalent with respect to open formulas. A similar earlier result relating open formulas of dependence logic to the negative fragment of existential second-order logic was proved in [2].
The first author was supported by grant 127661 of the Academy of Finland and the European Science Foundation Eurocores programme LogICCC [FP002 - Logic for Interaction (LINT)] through grant 129208 of the Academy of Finland. The second author was supported by the MALJA Graduate school in Mathematical logic.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Väänänen, J.: Dependence logic: A New Approach to Independence Friendly Logic. London Mathematical Society Student Texts, vol. 70, p. 234. Cambridge University Press, Cambridge (2007)
Kontinen, J., Väänänen, J.: On definability in dependence logic. To appear in Journal of Logic, Language and Information (2007)
Hodges, W.: Compositional semantics for a language of imperfect information. Log. J. IGPL 5(4), 539–563 (1997) (electronic)
Henkin, L.: Some remarks on infinitely long formulas. In: Infinitistic Methods (Proc. Sympos. Foundations of Math., Warsaw, 1959), pp. 167–183. Pergamon Press, Oxford (1961)
Hintikka, J., Sandu, G.: Informational independence as a semantical phenomenon. In: Logic, methodology and philosophy of science, VIII (Moscow, 1987). Stud. Logic Found. Math, vol. 126, pp. 571–589. North-Holland, Amsterdam (1989)
Hintikka, J.: The Principles of Mathematics Revisited. Cambridge University Press, Cambridge (1996)
Walkoe Jr., W.J.: Finite partially-ordered quantification. J. Symbolic Logic 35, 535–555 (1970)
Enderton, H.B.: Finite partially-ordered quantifiers. Z. Math. Logik Grundlagen Math. 16, 393–397 (1970)
Nurmi, V.: Dependence Logic: Investigations into Higher-Order Semantics Defined on Teams. PhD thesis, University of Helsinki (2009)
Väänänen, J.: Personal communication (2009)
Skolem, T.: Logisch-kombinatorische Untersuchungen über die Erfüllbarkeit oder Beweisbarkeit mathematischer Sätze nebst einem Theoreme über dichte Mengen. Skrifter utgit av Videnskappsselskapet i Kristiania (1920)
Skolem, T.: Selected works in logic. Edited by Jens Erik Fenstad. Universitetsforlaget, Oslo (1970)
Abramsky, S., Väänänen, J.: From IF to BI, a tale of dependence and separation. Technical report, University of Amsterdam, ILLC Prepublication Series, PP-2008-27 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kontinen, J., Nurmi, V. (2009). Team Logic and Second-Order Logic. In: Ono, H., Kanazawa, M., de Queiroz, R. (eds) Logic, Language, Information and Computation. WoLLIC 2009. Lecture Notes in Computer Science(), vol 5514. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02261-6_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-02261-6_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02260-9
Online ISBN: 978-3-642-02261-6
eBook Packages: Computer ScienceComputer Science (R0)