Polyadic quantification via denoting concepts

DOI10.1215/00294527-2010-023MaRDI QIDQ989420zbMATH OpenOpenAlexFDO

Authors Ori Simchen

Publication date 20 August 2010

Published in Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1215/00294527-2010-023

zbMATH Keywords

denotingpolyadic quantificationRussell

Mathematics Subject Classification ID

History of mathematics in the 20th century (01A60) Classical first-order logic (03B10)

Review text

This paper deals with the syntactic rendering of the well-formed formulae (wffs) which contain non-commutable quantifiers and polyadic predicates, and then applies it to Russell's theory of denoting concepts.

Recommendations

• Russell's Early Theory of Denoting
• Russell's first theory of denoting and quantification
• Propositional Structure and B. Russell's Theory of Denoting inThe Principles of Mathematics
• A new interpretation of russell's multiple-relation theory of judgment
• On russell’s arguments for restricting modes of specification and domains of quantification

Cited in

(4)

• Russell's first theory of denoting and quantification
• Polyadic concept analysis
• Russell's Early Theory of Denoting
• On russell’s arguments for restricting modes of specification and domains of quantification

This page was built for publication: Polyadic quantification via denoting concepts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q989420)