# A General Theory of Abstraction Operators

@article{Tennant2004AGT, title={A General Theory of Abstraction Operators}, author={Neil Tennant}, journal={The Philosophical Quarterly}, year={2004}, volume={54}, pages={105-133} }

I present a general theory of abstraction operators which treats them as variable-binding term-forming operators, and provides a reasonably uniform treatment for definite descriptions, set abstracts, natural number abstraction, and real number abstraction. This minimizing, extensional and relational theory reveals a striking similarity between definite descriptions and set abstracts, and provides a clear rationale for the claim that there is a logic of sets (which is ontologically noncommittal… Expand

#### Topics from this paper

#### 27 Citations

Two Treatments of Definite Descriptions in Intuitionist Negative Free Logic

- Computer Science, Mathematics
- ArXiv
- 2021

The present paper compares the two approaches to an axiomatic treatment of a term forming ℩ operator within intuitionist negative free logic and shows the two systems to be equivalent through a translation between their respective languages. Expand

Two Treatments of Definite Descriptions in Intuitionist Negative Free Logic

- Computer Science, Mathematics
- 2021

The present paper compares the two approaches to the formalisation of definite descriptions with a binary quantifier ι using a system of Tennant’s and an axiomatic treatment of a term forming ι operator within intuitionist negative free logic. Expand

Definite Descriptions in Intuitionist Positive Free Logic

- Computer Science, Philosophy
- ArXiv
- 2021

This paper presents rules of inference for a binary quantifier I for the formalisation of sentences containing definite descriptions within intuitionist positive free logic and shows it to have desirable proof-theoretic properties. Expand

Definite Descriptions in Intuitionist Positive Free Logic

- Computer Science, Mathematics
- 2021

This paper presents rules of inference for a binary quantifier I for the formalisation of sentences containing definite descriptions within intuitionist positive free logic and shows it to have desirable proof-theoretic properties. Expand

Natural Logicism via the Logic of Orderly Pairing

- Computer Science
- 2009

The aim here is to describe how to complete the constructive logicist program, in the author’s book Anti-Realism and Logic, of deriving all the Peano–Dedekind postulates for arithmetic within a… Expand

A Logic Inspired by Natural Language: Quantifiers As Subnectors

- Mathematics, Computer Science
- J. Philos. Log.
- 2014

The paper criticizes Frege's original regimentation of quantified sentences of natural language, and argues for advantages of the proposed variant of first-order logic, in which quantifiers are not sentential operators, but are used as subnectors. Expand

Parts, classes and Parts of Classes: an anti-realist reading of Lewisian mereology

- Philosophy, Computer Science
- Synthese
- 2012

Whether an anti-realist, inferentialist theorist of meaning has the resources to exhibit Lewis’s argument for his Second Thesis—which is central to his marriage of class theory with mereology—as a purely conceptual one is determined. Expand

Tableaux for Free Logics with Descriptions

- Computer Science
- TABLEAUX
- 2021

Five analytic tableau systems corresponding to different kinds of free logic, including the logic of definedness applied in computer science and constructive mathematics for dealing with partial functions (here called negative quasi-free logic) are considered. Expand

On the Origin of Abstraction: Real and Imaginary Parts of Decidability-Making

- Mathematics
- 2012

The behavioral tradition has largely anchored on Simon's early conception of bounded rationality, it is important to engage more explicitly cognitive approaches particularly ones that might link to… Expand

Free Definite Description Theory – Sequent Calculi and Cut Elimination

- Computer Science
- 2020

It is shown that the same theory in different logics may be formalised by means of different rules and gives results of varying strength. Expand

#### References

SHOWING 1-7 OF 7 REFERENCES

Reals by Abstractiont

- Mathematics
- 2000

ions like the Direction equivalence and Hume’s principle and that it is reasonable to regard it as one. We might bring EM into line with the characterisation of abstraction principles with which I… Expand

Logic And Existence: Ian Rumfitt

- Philosophy
- 1999

Frege’s logicism in the philosophy of arithmetic consisted, au fond , in the claim that in justifying basic arithmetical axioms a thinker need appeal only to methods and principles which he already… Expand

From Frege to Gödel: A Source Book in Mathematical Logic, 1879-1931

- Mathematics
- 1967

The fundamental texts of the great classical period in modern logic, some of them never before available in English translation, are here gathered together for the first time. Modern logic, heralded… Expand