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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,923

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

Logic: an introduction.Greg Restall - 2006 - New York: Routledge.
A squib on anaphora and coindexing.Reinhard Muskens - 2011 - Linguistics and Philosophy 34 (1):85-89.
Wittgensteinian Predicate Logic.Kai F. Wehmeier - 2004 - Notre Dame Journal of Formal Logic 45 (1):1-11.
About finite predicate logic.Herman Dishkant - 1986 - Studia Logica 45 (4):405 - 414.
Sequence semantics for dynamic predicate logic.C. F. M. Vermeulen - 1993 - Journal of Logic, Language and Information 2 (3):217-254.
Monadic fuzzy predicate logics.Petr Hájek - 2002 - Studia Logica 71 (2):165-175.

Analytics

Added to PP
2010-09-11

Downloads
2 (#1,816,161)

6 months
0

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