68 ideas
13939 | No possible evidence could decide the reality of numbers, so it is a pseudo-question [Carnap] |
16252 | Metaphysics uses empty words, or just produces pseudo-statements [Carnap] |
10073 | There cannot be a set theory which is complete [Smith,P] |
10616 | Second-order arithmetic can prove new sentences of first-order [Smith,P] |
13342 | Carnap defined consequence by contradiction, but this is unintuitive and changes with substitution [Tarski on Carnap] |
13251 | Each person is free to build their own logic, just by specifying a syntax [Carnap] |
10076 | The 'range' of a function is the set of elements in the output set created by the function [Smith,P] |
10605 | Two functions are the same if they have the same extension [Smith,P] |
10075 | A 'partial function' maps only some elements to another set [Smith,P] |
10074 | A 'total function' maps every element to one element in another set [Smith,P] |
10612 | An argument is a 'fixed point' for a function if it is mapped back to itself [Smith,P] |
10615 | The Comprehension Schema says there is a property only had by things satisfying a condition [Smith,P] |
10595 | A 'theorem' of a theory is a sentence derived from the axioms using the proof system [Smith,P] |
10602 | A 'natural deduction system' has no axioms but many rules [Smith,P] |
10613 | No nice theory can define truth for its own language [Smith,P] |
10078 | An 'injective' ('one-to-one') function creates a distinct output element from each original [Smith,P] |
10077 | A 'surjective' ('onto') function creates every element of the output set [Smith,P] |
10079 | A 'bijective' function has one-to-one correspondence in both directions [Smith,P] |
10070 | If everything that a theory proves is true, then it is 'sound' [Smith,P] |
10086 | Soundness is true axioms and a truth-preserving proof system [Smith,P] |
10596 | A theory is 'sound' iff every theorem is true (usually from true axioms and truth-preservation) [Smith,P] |
10598 | A theory is 'negation complete' if it proves all sentences or their negation [Smith,P] |
10597 | 'Complete' applies both to whole logics, and to theories within them [Smith,P] |
10069 | A theory is 'negation complete' if one of its sentences or its negation can always be proved [Smith,P] |
10609 | Two routes to Incompleteness: semantics of sound/expressible, or syntax of consistency/proof [Smith,P] |
10080 | 'Effective' means simple, unintuitive, independent, controlled, dumb, and terminating [Smith,P] |
10087 | A theory is 'decidable' if all of its sentences could be mechanically proved [Smith,P] |
10088 | Any consistent, axiomatized, negation-complete formal theory is decidable [Smith,P] |
10081 | A set is 'enumerable' is all of its elements can result from a natural number function [Smith,P] |
10083 | A set is 'effectively enumerable' if a computer could eventually list every member [Smith,P] |
10084 | A finite set of finitely specifiable objects is always effectively enumerable (e.g. primes) [Smith,P] |
10085 | The set of ordered pairs of natural numbers <i,j> is effectively enumerable [Smith,P] |
10601 | The thorems of a nice arithmetic can be enumerated, but not the truths (so they're diffferent) [Smith,P] |
10600 | Being 'expressible' depends on language; being 'capture/represented' depends on axioms and proof system [Smith,P] |
10599 | For primes we write (x not= 1 ∧ ∀u∀v(u x v = x → (u = 1 ∨ v = 1))) [Smith,P] |
10610 | The reals contain the naturals, but the theory of reals doesn't contain the theory of naturals [Smith,P] |
10619 | The truths of arithmetic are just true equations and their universally quantified versions [Smith,P] |
10608 | The number of Fs is the 'successor' of the Gs if there is a single F that isn't G [Smith,P] |
10618 | All numbers are related to zero by the ancestral of the successor relation [Smith,P] |
10849 | Baby arithmetic covers addition and multiplication, but no general facts about numbers [Smith,P] |
10850 | Baby Arithmetic is complete, but not very expressive [Smith,P] |
10851 | Robinson Arithmetic 'Q' has basic axioms, quantifiers and first-order logic [Smith,P] |
10852 | Robinson Arithmetic (Q) is not negation complete [Smith,P] |
10068 | Natural numbers have zero, unique successors, unending, no circling back, and no strays [Smith,P] |
10603 | The logic of arithmetic must quantify over properties of numbers to handle induction [Smith,P] |
10848 | Multiplication only generates incompleteness if combined with addition and successor [Smith,P] |
10604 | Incompleteness results in arithmetic from combining addition and successor with multiplication [Smith,P] |
13936 | Questions about numbers are answered by analysis, and are analytic, and hence logically true [Carnap] |
8748 | Logical positivists incorporated geometry into logicism, saying axioms are just definitions [Carnap, by Shapiro] |
8960 | Internal questions about abstractions are trivial, and external ones deeply problematic [Carnap, by Szabó] |
16062 | A necessary relation between fact-levels seems to be a further irreducible fact [Lynch/Glasgow] |
16061 | If some facts 'logically supervene' on some others, they just redescribe them, adding nothing [Lynch/Glasgow] |
13933 | Existence questions are 'internal' (within a framework) or 'external' (concerning the whole framework) [Carnap] |
13934 | To be 'real' is to be an element of a system, so we cannot ask reality questions about the system itself [Carnap] |
16060 | Nonreductive materialism says upper 'levels' depend on lower, but don't 'reduce' [Lynch/Glasgow] |
16064 | The hallmark of physicalism is that each causal power has a base causal power under it [Lynch/Glasgow] |
13938 | A linguistic framework involves commitment to entities, so only commitment to the framework is in question [Carnap] |
10617 | The 'ancestral' of a relation is a new relation which creates a long chain of the original relation [Smith,P] |
13935 | We only accept 'things' within a language with formation, testing and acceptance rules [Carnap] |
14305 | In the truth-functional account a burnt-up match was soluble because it never entered water [Carnap] |
13932 | Empiricists tend to reject abstract entities, and to feel sympathy with nominalism [Carnap] |
13937 | New linguistic claims about entities are not true or false, but just expedient, fruitful or successful [Carnap] |
18699 | Carnap tried to define all scientific predicates in terms of primitive relations, using type theory [Carnap, by Button] |
13940 | All linguistic forms in science are merely judged by their efficiency as instruments [Carnap] |
13048 | Good explications are exact, fruitful, simple and similar to the explicandum [Carnap, by Salmon] |
12131 | All concepts can be derived from a few basics, making possible one science of everything [Carnap, by Brody] |
11968 | The intension of a sentence is the set of all possible worlds in which it is true [Carnap, by Kaplan] |
18285 | All translation loses some content (but language does not create reality) [Carnap] |