structure for 'Theory of Logic'    |     alphabetical list of themes    |     expand these ideas

5. Theory of Logic / A. Overview of Logic / 5. First-Order Logic

[logic where variables only refer to objects]

18 ideas
Asserting first-order validity implicitly involves second-order reference to classes [Putnam]
Elementary logic is complete, but cannot capture mathematics [Tharp]
First-order logic is the strongest complete compact theory with L÷wenheim-Skolem [Hacking]
A limitation of first-order logic is that it cannot handle branching quantifiers [Hacking]
First-order logic is not decidable: there is no test of whether any formula is valid [Bostock]
The completeness of first-order logic implies its compactness [Bostock]
Since first-order languages are complete, |= and |- have the same meaning [Hodges,W]
In quantified language the components of complex sentences may not be sentences [Kirkham]
First-order logic only has its main theorems because it is so weak [Mayberry]
The 'triumph' of first-order logic may be related to logicism and the Hilbert programme, which failed [Shapiro]
Maybe compactness, semantic effectiveness, and the L÷wenheim-Skolem properties are desirable [Shapiro]
First-order logic was an afterthought in the development of modern logic [Shapiro]
The notion of finitude is actually built into first-order languages [Shapiro]
First-order logic is Complete, and Compact, with the L÷wenheim-Skolem Theorems [Shapiro]
A first-order 'sentence' is a formula with no free variables [Zalabardo]
Not all validity is captured in first-order logic [Read]
In first-order logic syntactic and semantic consequence (|- and |=) nicely coincide [Wolf,RS]
First-order logic is weakly complete (valid sentences are provable); we can't prove every sentence or its negation [Wolf,RS]