Predicate Logic (with Anaphora)

Abstract

D2.1 (PL models and assignments) i. A PL model is a pair M = 〈DM, ·M〉 such that (a) DM is a non-empty set, and (b) ·M maps each A ∈ Con to AM ∈ DM, and each B ∈ Prdn to BM  (DM)n. ii. GM = {g| g: Var  DM} is the set of M-assignments. For any g ∈ GM, u ∈ Var, d ∈ DM, g[u/d] := (g\{u, g(u)})  {u, d} is the u-to-d alternative to g

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,019

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

  • Only published works are available at libraries.

Similar books and articles

Spector forcing.J. M. Henle - 1984 - Journal of Symbolic Logic 49 (2):542-554.
The classification of small types of rank ω, part I.Steven Buechler & Colleen Hoover - 2001 - Journal of Symbolic Logic 66 (4):1884-1898.
Relative Vaught's Conjecture for Some Meager Groups.Ludomir Newelski - 2007 - Notre Dame Journal of Formal Logic 48 (1):115-132.
Der bürgerliche Realismus.Friedrich Weyel - 1927 - Vieweg+Teubner Verlag.

Analytics

Added to PP
2010-09-11

Downloads
2 (#1,906,089)

6 months
2 (#1,697,385)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references