more from this thinker     |     more from this text


Single Idea 13670

[filed under theme 5. Theory of Logic / J. Model Theory in Logic / 2. Isomorphisms ]

Full Idea

Categoricity cannot be attained in a first-order language.

Gist of Idea

Categoricity can't be reached in a first-order language

Source

Stewart Shapiro (Foundations without Foundationalism [1991], 7.3)

Book Ref

Shapiro,Stewart: 'Foundations without Foundationalism' [OUP 1991], p.196

Related Ideas

Idea 10758 If models of a mathematical theory are all isomorphic, it is 'categorical', with essentially one model [Rossberg]

Idea 13636 An axiomatization is 'categorical' if its models are isomorphic, so there is really only one interpretation [Shapiro]


The 13 ideas with the same theme [ways in which two models or theories map together]:

If cats equal cherries, model theory allows reinterpretation of the whole language preserving truth [Putnam]
A consistent theory just needs one model; isomorphic versions will do too, and large domains provide those [Lewis]
An 'injective' ('one-to-one') function creates a distinct output element from each original [Smith,P]
A 'surjective' ('onto') function creates every element of the output set [Smith,P]
A 'bijective' function has one-to-one correspondence in both directions [Smith,P]
An axiomatization is 'categorical' if its models are isomorphic, so there is really only one interpretation [Shapiro]
Categoricity can't be reached in a first-order language [Shapiro]
Theory ontology is never complete, but is only determined 'up to isomorphism' [Shapiro]
The set-theoretical hierarchy contains as many isomorphism types as possible [Shapiro]
Differences between isomorphic structures seem unimportant [George/Velleman]
An 'isomorphism' is a bijection that preserves all structural components [Wolf,RS]
A theory is 'categorical' if it has just one model up to isomorphism [Horsten]
If models of a mathematical theory are all isomorphic, it is 'categorical', with essentially one model [Rossberg]