Combining Texts

All the ideas for 'Intro to G��del's Theorems', 'Hilbert's Programme' and 'The Structure of Objects'

expand these ideas     |    start again     |     specify just one area for these texts


69 ideas

4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / a. Axioms for sets
There cannot be a set theory which is complete [Smith,P]
4. Formal Logic / G. Formal Mereology / 1. Mereology
The 'aggregative' objections says mereology gets existence and location of objects wrong [Koslicki]
5. Theory of Logic / A. Overview of Logic / 7. Second-Order Logic
Second-order arithmetic can prove new sentences of first-order [Smith,P]
5. Theory of Logic / B. Logical Consequence / 1. Logical Consequence
Consequence is truth-preserving, either despite substitutions, or in all interpretations [Koslicki]
5. Theory of Logic / B. Logical Consequence / 4. Semantic Consequence |=
'Roses are red; therefore, roses are colored' seems truth-preserving, but not valid in a system [Koslicki]
5. Theory of Logic / E. Structures of Logic / 5. Functions in Logic
A 'partial function' maps only some elements to another set [Smith,P]
A 'total function' maps every element to one element in another set [Smith,P]
An argument is a 'fixed point' for a function if it is mapped back to itself [Smith,P]
The 'range' of a function is the set of elements in the output set created by the function [Smith,P]
Two functions are the same if they have the same extension [Smith,P]
5. Theory of Logic / E. Structures of Logic / 7. Predicates in Logic
The Comprehension Schema says there is a property only had by things satisfying a condition [Smith,P]
5. Theory of Logic / E. Structures of Logic / 8. Theories in Logic
A 'theorem' of a theory is a sentence derived from the axioms using the proof system [Smith,P]
5. Theory of Logic / H. Proof Systems / 4. Natural Deduction
A 'natural deduction system' has no axioms but many rules [Smith,P]
5. Theory of Logic / I. Semantics of Logic / 2. Formal Truth
No nice theory can define truth for its own language [Smith,P]
5. Theory of Logic / J. Model Theory in Logic / 2. Isomorphisms
A 'surjective' ('onto') function creates every element of the output set [Smith,P]
An 'injective' ('one-to-one') function creates a distinct output element from each original [Smith,P]
A 'bijective' function has one-to-one correspondence in both directions [Smith,P]
5. Theory of Logic / K. Features of Logics / 3. Soundness
If everything that a theory proves is true, then it is 'sound' [Smith,P]
Soundness is true axioms and a truth-preserving proof system [Smith,P]
A theory is 'sound' iff every theorem is true (usually from true axioms and truth-preservation) [Smith,P]
5. Theory of Logic / K. Features of Logics / 4. Completeness
A theory is 'negation complete' if it proves all sentences or their negation [Smith,P]
'Complete' applies both to whole logics, and to theories within them [Smith,P]
A theory is 'negation complete' if one of its sentences or its negation can always be proved [Smith,P]
5. Theory of Logic / K. Features of Logics / 5. Incompleteness
Two routes to Incompleteness: semantics of sound/expressible, or syntax of consistency/proof [Smith,P]
5. Theory of Logic / K. Features of Logics / 7. Decidability
'Effective' means simple, unintuitive, independent, controlled, dumb, and terminating [Smith,P]
A theory is 'decidable' if all of its sentences could be mechanically proved [Smith,P]
Any consistent, axiomatized, negation-complete formal theory is decidable [Smith,P]
5. Theory of Logic / K. Features of Logics / 8. Enumerability
A set is 'enumerable' is all of its elements can result from a natural number function [Smith,P]
A set is 'effectively enumerable' if a computer could eventually list every member [Smith,P]
A finite set of finitely specifiable objects is always effectively enumerable (e.g. primes) [Smith,P]
The set of ordered pairs of natural numbers <i,j> is effectively enumerable [Smith,P]
The thorems of a nice arithmetic can be enumerated, but not the truths (so they're diffferent) [Smith,P]
5. Theory of Logic / K. Features of Logics / 9. Expressibility
Being 'expressible' depends on language; being 'capture/represented' depends on axioms and proof system [Smith,P]
6. Mathematics / A. Nature of Mathematics / 3. Nature of Numbers / a. Numbers
For primes we write (x not= 1 ∧ ∀u∀v(u x v = x → (u = 1 ∨ v = 1))) [Smith,P]
6. Mathematics / A. Nature of Mathematics / 3. Nature of Numbers / g. Real numbers
The reals contain the naturals, but the theory of reals doesn't contain the theory of naturals [Smith,P]
6. Mathematics / A. Nature of Mathematics / 4. Using Numbers / f. Arithmetic
The truths of arithmetic are just true equations and their universally quantified versions [Smith,P]
6. Mathematics / A. Nature of Mathematics / 5. The Infinite / a. The Infinite
Gödel showed that the syntactic approach to the infinite is of limited value [Kreisel]
6. Mathematics / B. Foundations for Mathematics / 1. Foundations for Mathematics
The study of mathematical foundations needs new non-mathematical concepts [Kreisel]
6. Mathematics / B. Foundations for Mathematics / 4. Axioms for Number / a. Axioms for numbers
All numbers are related to zero by the ancestral of the successor relation [Smith,P]
The number of Fs is the 'successor' of the Gs if there is a single F that isn't G [Smith,P]
6. Mathematics / B. Foundations for Mathematics / 4. Axioms for Number / b. Baby arithmetic
Baby arithmetic covers addition and multiplication, but no general facts about numbers [Smith,P]
Baby Arithmetic is complete, but not very expressive [Smith,P]
6. Mathematics / B. Foundations for Mathematics / 4. Axioms for Number / c. Robinson arithmetic
Robinson Arithmetic 'Q' has basic axioms, quantifiers and first-order logic [Smith,P]
Robinson Arithmetic (Q) is not negation complete [Smith,P]
6. Mathematics / B. Foundations for Mathematics / 4. Axioms for Number / d. Peano arithmetic
Natural numbers have zero, unique successors, unending, no circling back, and no strays [Smith,P]
6. Mathematics / B. Foundations for Mathematics / 4. Axioms for Number / f. Mathematical induction
The logic of arithmetic must quantify over properties of numbers to handle induction [Smith,P]
6. Mathematics / B. Foundations for Mathematics / 4. Axioms for Number / g. Incompleteness of Arithmetic
Multiplication only generates incompleteness if combined with addition and successor [Smith,P]
Incompleteness results in arithmetic from combining addition and successor with multiplication [Smith,P]
6. Mathematics / B. Foundations for Mathematics / 7. Mathematical Structuralism / e. Structuralism critique
Some questions concern mathematical entities, rather than whole structures [Koslicki]
8. Modes of Existence / A. Relations / 3. Structural Relations
Structures have positions, constituent types and number, and some invariable parts [Koslicki]
8. Modes of Existence / A. Relations / 4. Formal Relations / c. Ancestral relation
The 'ancestral' of a relation is a new relation which creates a long chain of the original relation [Smith,P]
8. Modes of Existence / B. Properties / 6. Categorical Properties
'Categorical' properties exist in the actual world, and 'hypothetical' properties in other worlds [Koslicki]
9. Objects / B. Unity of Objects / 1. Unifying an Object / a. Intrinsic unification
I aim to put the notion of structure or form back into the concepts of part, whole and object [Koslicki]
If a whole is just a structure, a dinner party wouldn't need the guests to turn up [Koslicki]
9. Objects / B. Unity of Objects / 3. Unity Problems / c. Statue and clay
The clay is just a part of the statue (its matter); the rest consists of its form or structure [Koslicki]
Statue and clay differ in modal and temporal properties, and in constitution [Koslicki]
9. Objects / C. Structure of Objects / 2. Hylomorphism / c. Form as causal
Structure or form are right at the centre of modern rigorous modes of enquiry [Koslicki]
9. Objects / C. Structure of Objects / 6. Constitution of an Object
There are at least six versions of constitution being identity [Koslicki]
9. Objects / C. Structure of Objects / 8. Parts of Objects / a. Parts of objects
For three-dimensionalist parthood must be a three-place relation, including times [Koslicki]
The parts may be the same type as the whole, like a building made of buildings [Koslicki]
9. Objects / C. Structure of Objects / 8. Parts of Objects / c. Wholes from parts
Wholes in modern mereology are intended to replace sets, so they closely resemble them [Koslicki]
Wholes are entities distinct from their parts, and have different properties [Koslicki]
Wholes are not just their parts; a whole is an entity distinct from the proper parts [Koslicki]
26. Natural Theory / B. Natural Kinds / 1. Natural Kinds
The Kripke/Putnam approach to natural kind terms seems to give them excessive stability [Koslicki]
26. Natural Theory / B. Natural Kinds / 3. Knowing Kinds
Natural kinds support inductive inferences, from previous samples to the next one [Koslicki]
26. Natural Theory / B. Natural Kinds / 4. Source of Kinds
Concepts for species are either intrinsic structure, or relations like breeding or ancestry [Koslicki]
26. Natural Theory / B. Natural Kinds / 5. Reference to Natural Kinds
Should vernacular classifications ever be counted as natural kind terms? [Koslicki]
26. Natural Theory / D. Laws of Nature / 11. Against Laws of Nature
There are apparently no scientific laws concerning biological species [Koslicki]
27. Natural Reality / C. Space / 3. Points in Space
The natural conception of points ducks the problem of naming or constructing each point [Kreisel]