- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Perfect IFG-Formulas
Logica Universalis 2 (2):265-275 (2008)
Abstract
IFG logic is a variant of the independence-friendly logic of Hintikka and Sandu. We answer the question: “Which IFG-formulas are equivalent to ordinary first-order formulas?” We use the answer to prove the ordinary cylindric set algebra over a structure can be embedded into a reduct of the IFG-cylindric set algebra over the structureLinks
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
On an interpretation of second order quantification in first order intuitionistic propositional logic.Andrew M. Pitts - 1992 - Journal of Symbolic Logic 57 (1):33-52.
On the logic of informational independence and its applications.Gabriel Sandu - 1993 - Journal of Philosophical Logic 22 (1):29 - 60.
An Infinitary Extension of Jankov’s Theorem.Yoshihito Tanaka - 2007 - Studia Logica 86 (1):111 - 131.
Step by step – Building representations in algebraic logic.Robin Hirsch & Ian Hodkinson - 1997 - Journal of Symbolic Logic 62 (1):225-279.
Predicate provability logic with non-modalized quantifiers.Giorgie Dzhaparidze - 1991 - Studia Logica 50 (1):149 - 160.
Contradiction and contrariety. Priest on negation.Heinrich Wansing - 2006 - Poznan Studies in the Philosophy of the Sciences and the Humanities 91 (1):81-93.
Algorithmic problems concerning first-order definability of modal formulas on the class of all finite frames.A. V. Chagrov & L. A. Chagrova - 1995 - Studia Logica 55 (3):421 - 448.
Analytics
Added to PP
2009-01-28
Downloads
41 (#385,570)
6 months
6 (#509,139)
2009-01-28
Downloads
41 (#385,570)
6 months
6 (#509,139)
Historical graph of downloads
References found in this work
Compositional semantics for a language of imperfect information.W. Hodges - 1997 - Logic Journal of the IGPL 5 (4):539-563.
Independence-friendly cylindric set algebras.Allen Mann - 2009 - Logic Journal of the IGPL 17 (6):719-754.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-659b74868d-nj4fk uwo