Combining Texts

All the ideas for 'Demonstratives', 'fragments/reports' and 'First-order Logic, 2nd-order, Completeness'

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


18 ideas

2. Reason / A. Nature of Reason / 9. Limits of Reason
All reasoning endlessly leads to further reasoning (Mode 12) [Agrippa, by Diog. Laertius]
     Full Idea: Twelfth mode: all reasoning leads on to further reasoning, and this process goes on forever.
     From: report of Agrippa (fragments/reports [c.60]) by Diogenes Laertius - Lives of Eminent Philosophers 09.Py.10
Proofs often presuppose the thing to be proved (Mode 15) [Agrippa, by Diog. Laertius]
     Full Idea: Fifteenth mode: proofs often presuppose the thing to be proved.
     From: report of Agrippa (fragments/reports [c.60]) by Diogenes Laertius - Lives of Eminent Philosophers 09.Py.10
Reasoning needs arbitrary faith in preliminary hypotheses (Mode 14) [Agrippa, by Diog. Laertius]
     Full Idea: Fourteenth mode: reasoning requires arbitrary faith in preliminary hypotheses.
     From: report of Agrippa (fragments/reports [c.60]) by Diogenes Laertius - Lives of Eminent Philosophers 09.Py.10
All discussion is full of uncertainty and contradiction (Mode 11) [Agrippa, by Diog. Laertius]
     Full Idea: Eleventh mode: all topics of discussion are full of uncertainty and contradiction.
     From: report of Agrippa (fragments/reports [c.60]) by Diogenes Laertius - Lives of Eminent Philosophers 09.Py.10
5. Theory of Logic / A. Overview of Logic / 7. Second-Order Logic
Second-order logic needs the sets, and its consequence has epistemological problems [Rossberg]
     Full Idea: Second-order logic raises doubts because of its ontological commitment to the set-theoretic hierarchy, and the allegedly problematic epistemic status of the second-order consequence relation.
     From: Marcus Rossberg (First-order Logic, 2nd-order, Completeness [2004], §1)
     A reaction: The 'epistemic' problem is whether you can know the truths, given that the logic is incomplete, and so they cannot all be proved. Rossberg defends second-order logic against the second problem. A third problem is that it may be mathematics.
Henkin semantics has a second domain of predicates and relations (in upper case) [Rossberg]
     Full Idea: Henkin semantics (for second-order logic) specifies a second domain of predicates and relations for the upper case constants and variables.
     From: Marcus Rossberg (First-order Logic, 2nd-order, Completeness [2004], §3)
     A reaction: This second domain is restricted to predicates and relations which are actually instantiated in the model. Second-order logic is complete with this semantics. Cf. Idea 10756.
There are at least seven possible systems of semantics for second-order logic [Rossberg]
     Full Idea: In addition to standard and Henkin semantics for second-order logic, one might also employ substitutional or game-theoretical or topological semantics, or Boolos's plural interpretation, or even a semantics inspired by Lesniewski.
     From: Marcus Rossberg (First-order Logic, 2nd-order, Completeness [2004], §3)
     A reaction: This is helpful in seeing the full picture of what is going on in these logical systems.
5. Theory of Logic / B. Logical Consequence / 2. Types of Consequence
Logical consequence is intuitively semantic, and captured by model theory [Rossberg]
     Full Idea: Logical consequence is intuitively taken to be a semantic notion, ...and it is therefore the formal semantics, i.e. the model theory, that captures logical consequence.
     From: Marcus Rossberg (First-order Logic, 2nd-order, Completeness [2004], §2)
     A reaction: If you come at the issue from normal speech, this seems right, but if you start thinking about the necessity of logical consequence, that formal rules and proof-theory seem to be the foundation.
5. Theory of Logic / B. Logical Consequence / 3. Deductive Consequence |-
Γ |- S says S can be deduced from Γ; Γ |= S says a good model for Γ makes S true [Rossberg]
     Full Idea: Deductive consequence, written Γ|-S, is loosely read as 'the sentence S can be deduced from the sentences Γ', and semantic consequence Γ|=S says 'all models that make Γ true make S true as well'.
     From: Marcus Rossberg (First-order Logic, 2nd-order, Completeness [2004], §2)
     A reaction: We might read |= as 'true in the same model as'. What is the relation, though, between the LHS and the RHS? They seem to be mutually related to some model, but not directly to one another.
5. Theory of Logic / E. Structures of Logic / 1. Logical Form
In proof-theory, logical form is shown by the logical constants [Rossberg]
     Full Idea: A proof-theorist could insist that the logical form of a sentence is exhibited by the logical constants that it contains.
     From: Marcus Rossberg (First-order Logic, 2nd-order, Completeness [2004], §2)
     A reaction: You have to first get to the formal logical constants, rather than the natural language ones. E.g. what is the truth table for 'but'? There is also the matter of the quantifiers and the domain, and distinguishing real objects and predicates from bogus.
5. Theory of Logic / J. Model Theory in Logic / 1. Logical Models
A model is a domain, and an interpretation assigning objects, predicates, relations etc. [Rossberg]
     Full Idea: A standard model is a set of objects called the 'domain', and an interpretation function, assigning objects in the domain to names, subsets to predicate letters, subsets of the Cartesian product of the domain with itself to binary relation symbols etc.
     From: Marcus Rossberg (First-order Logic, 2nd-order, Completeness [2004], §3)
     A reaction: The model actually specifies which objects have which predicates, and which objects are in which relations. Tarski's account of truth in terms of 'satisfaction' seems to be just a description of those pre-decided facts.
5. Theory of Logic / J. Model Theory in Logic / 2. Isomorphisms
If models of a mathematical theory are all isomorphic, it is 'categorical', with essentially one model [Rossberg]
     Full Idea: A mathematical theory is 'categorical' if, and only if, all of its models are isomorphic. Such a theory then essentially has just one model, the standard one.
     From: Marcus Rossberg (First-order Logic, 2nd-order, Completeness [2004], §3)
     A reaction: So the term 'categorical' is gradually replacing the much-used phrase 'up to isomorphism'.
5. Theory of Logic / K. Features of Logics / 4. Completeness
Completeness can always be achieved by cunning model-design [Rossberg]
     Full Idea: All that should be required to get a semantics relative to which a given deductive system is complete is a sufficiently cunning model-theorist.
     From: Marcus Rossberg (First-order Logic, 2nd-order, Completeness [2004], §5)
5. Theory of Logic / K. Features of Logics / 5. Incompleteness
A deductive system is only incomplete with respect to a formal semantics [Rossberg]
     Full Idea: No deductive system is semantically incomplete in and of itself; rather a deductive system is incomplete with respect to a specified formal semantics.
     From: Marcus Rossberg (First-order Logic, 2nd-order, Completeness [2004], §3)
     A reaction: This important point indicates that a system might be complete with one semantics and incomplete with another. E.g. second-order logic can be made complete by employing a 'Henkin semantics'.
13. Knowledge Criteria / A. Justification Problems / 2. Justification Challenges / a. Agrippa's trilemma
Agrippa's Trilemma: justification is infinite, or ends arbitrarily, or is circular [Agrippa, by Williams,M]
     Full Idea: Agrippa's Trilemma offers three possible outcomes for a regress of justification: the chain goes on for ever (infinite); or the chain stops at an unjustified proposition (arbitrary); or the chain eventually includes the original proposition (circular).
     From: report of Agrippa (fragments/reports [c.60], §2) by Michael Williams - Without Immediate Justification §2
     A reaction: This summarises Ideas 1911, 1913 and 1914. Agrippa's Trilemma is now a standard starting point for modern discussions of foundations. Personally I reject 2, and am torn between 1 (+ social consensus) and 3 (with a benign, coherent circle).
13. Knowledge Criteria / E. Relativism / 1. Relativism
Everything is perceived in relation to another thing (Mode 13) [Agrippa, by Diog. Laertius]
     Full Idea: Thirteenth mode: everything is always perceived in relation to something else.
     From: report of Agrippa (fragments/reports [c.60]) by Diogenes Laertius - Lives of Eminent Philosophers 09.Py.10
19. Language / C. Assigning Meanings / 10. Two-Dimensional Semantics
Indexicals have a 'character' (the standing meaning), and a 'content' (truth-conditions for one context) [Kaplan, by Macią/Garcia-Carpentiro]
     Full Idea: Kaplan distinguished two different semantic features of indexical expressions: a 'character' that captures the standing meaning of the expression, and a 'content' that consists of their truth-conditional contribution in particular contexts.
     From: report of David Kaplan (Demonstratives [1989]) by Macią/Garcia-Carpentiro - Introduction to 'Two-Dimensional Semantics' 1
     A reaction: This seems so clearly right that there isn't much to dispute. You can't understand the word 'I' or 'now' if you don't understand both its general purpose, and what it is doing in a particular utterance. But will this generalise to other semantics?
'Content' gives the standard modal profile, and 'character' gives rules for a context [Kaplan, by Schroeter]
     Full Idea: Kaplan sees two aspects of meaning, the 'content', reflecting a thing's modal profile, which is modelled by standard possible worlds semantics, and 'character', giving rules for different contexts. Proper names have constant character; indexicals vary.
     From: report of David Kaplan (Demonstratives [1989]) by Laura Schroeter - Two-Dimensional Semantics 1.1.1
     A reaction: This gives rise to 2-D matrices for representing meaning, and the possible worlds are used twice, for evaluating meaning and then for evaluating context of use. I've always been struck by the two-dimensional semantics of passwords.