About: Independence-friendly logic     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : yago:WikicatSystemsOfFormalLogic, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon
http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FIndependence-friendly_logic&invfp=IFP_OFF&sas=SAME_AS_OFF

Independence-friendly logic (IF logic; proposed by Jaakko Hintikka and in 1989) is an extension of classical first-order logic (FOL) by means of slashed quantifiers of the form and , where is a finite set of variables. The intended reading of is "there is a which is functionally independent from the variables in ". IF logic allows one to express more general patterns of dependence between variables than those which are implicit in first-order logic. This greater level of generality leads to an actual increase in expressive power; the set of can characterize the same classes of structures as existential second-order logic.

AttributesValues
rdf:type
rdfs:label
  • Independence-friendly logic (en)
  • Lógica de independência amigável (pt)
rdfs:comment
  • Independence-friendly logic (IF logic; proposed by Jaakko Hintikka and in 1989) is an extension of classical first-order logic (FOL) by means of slashed quantifiers of the form and , where is a finite set of variables. The intended reading of is "there is a which is functionally independent from the variables in ". IF logic allows one to express more general patterns of dependence between variables than those which are implicit in first-order logic. This greater level of generality leads to an actual increase in expressive power; the set of can characterize the same classes of structures as existential second-order logic. (en)
  • Lógica de independência amigável (do inglês Independence-Friendly, Lógica IF), proposta por Jaakko Hintikka e Gabriel Sandu em 1989, objetiva ser uma alternativa mais natural e intuitiva à clássica lógica de primeira ordem (FOL). Lógica do SE é caracterizada por quantificadores ramificados. Esta é mais expressiva que FOL porque permite que sejam expressas relações independentes entre variáveis quantificadas. (pt)
dcterms:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
Link from a Wikipage to an external page
reference
  • Burgess, John P., "A Remark on Henkin Sentences and Their Contraries", Notre Dame Journal of Formal Logic 44 :185-188 . (en)
  • Figueira, Santiago, Gorín, Daniel and Grimson, Rafael "On the Expressive Power of IF-Logic with Classical Negation", WoLLIC 2011 proceedings, pp. 135-145, ,http://www.glyc.dc.uba.ar/santiago/papers/iflso.pdf. (en)
  • Eklund, Matti and Kolak, Daniel, "Is Hintikka’s Logic First Order?" Synthese, 131: 371-388 June 2002, https://link.springer.com/content/pdf/10.1023%2FA%3A1016184410627. (en)
  • Hodges, Wilfrid , "Compositional semantics for a language of imperfect information". Journal of the IGPL 5: 539–563. (en)
  • Cameron, Peter and Hodges, Wilfrid , "Some combinatorics of imperfect information". Journal of Symbolic Logic 66: 673-684. (en)
  • Kontinen, Juha and Väänänen, Jouko, "On definability in dependence logic" , Journal of Logic, Language and Information 18 , 317-332. (en)
  • Enderton, Herbert B., "Finite Partially-Ordered Quantifiers", Mathematical Logic Quarterly Volume 16, Issue 8 1970 Pages 393–397. (en)
  • Hodges, Wilfrid, "Some Strange Quantifiers", in Lecture Notes in Computer Science 1261:51-65, Jan. 1997. (en)
  • Mann, Allen L., Sandu, Gabriel and Sevenster, Merlijn Independence-Friendly Logic. A Game-Theoretic Approach, Cambridge University Press, . (en)
  • Hintikka, Jaakko , "The Principles of Mathematics Revisited", Cambridge University Press, . (en)
  • Janssen, Theo M. V., "Independent choices and the interpretation of IF logic." Journal of Logic, Language and Information, Volume 11 Issue 3, Summer 2002, pp. 367-387 http://dare.uva.nl/document/1273. (en)
  • Hintikka, Jaakko, "Hyperclassical logic and its implications for logical theory", Bulletin of Symbolic Logic 8, 2002, 404-423http://www.math.ucla.edu/~asl/bsl/0803/0803-004.ps . (en)
  • Sandu, Gabriel, "On the Logic of Informational Independence and Its Applications", Journal of Philosophical Logic Vol. 22, No. 1 , pp. 29-60. (en)
  • Kolak, Daniel and Symons, John, "The Results are In: The Scope and Import of Hintikka’s Philosophy" in Daniel Kolak and John Symons, eds., Quantifiers, Questions, and Quantum Physics. Essays on the Philosophy of Jaakko Hintikka, Springer 2004, pp. 205-268 , . (en)
  • Sandu, Gabriel, "If-Logic and Truth-definition", Journal of Philosophical Logic April 1998, Volume 27, Issue 2, pp 143–164. (en)
  • Kolak, Daniel, On Hintikka, Belmont: Wadsworth 2001 . (en)
  • Hintikka, Jaakko and Sandu, Gabriel , "Informational independence as a semantical phenomenon", in Logic, Methodology and Philosophy of Science VIII , North-Holland, Amsterdam, . (en)
  • Hintikka, Jaakko and Sandu, Gabriel, "Game-theoretical semantics", in Handbook of logic and language, ed. J. van Benthem and A. ter Meulen, Elsevier 1996 Updated in the 2nd second edition of the book . (en)
  • Feferman, Solomon, "What kind of logic is “Independence Friendly” logic?", in The Philosophy of Jaakko Hintikka ; Library of Living Philosophers vol. 30, Open Court , 453-469, http://math.stanford.edu/~feferman/papers/hintikka_iia.pdf. (en)
  • Walkoe, Wilbur John Jr., "Finite Partially-Ordered Quantification", The Journal of Symbolic Logic Vol. 35, No. 4 , pp. 535-555. (en)
  • Väänänen, Jouko, 2007, 'Dependence Logic -- A New Approach to Independence Friendly Logic', Cambridge University Press, , https://web.archive.org/web/20070921164444/http://www.cambridge.org/uk/catalogue/catalogue.asp?isbn=9780521876599. (en)
sameAs
dbp:wikiPageUsesTemplate
Faceted Search & Find service v1.17_git139 as of Feb 29 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 51 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software