18 ideas
| 15375 | If terms change their designations in different states, they are functions from states to objects [Fitting] |
| Full Idea: The common feature of every designating term is that designation may change from state to state - thus it can be formalized by a function from states to objects. | |
| From: Melvin Fitting (Intensional Logic [2007], 3) | |
| A reaction: Specifying the objects sounds OK, but specifying states sounds rather tough. |
| 15376 | Intensional logic adds a second type of quantification, over intensional objects, or individual concepts [Fitting] |
| Full Idea: To first order modal logic (with quantification over objects) we can add a second kind of quantification, over intensions. An intensional object, or individual concept, will be modelled by a function from states to objects. | |
| From: Melvin Fitting (Intensional Logic [2007], 3.3) |
| 15378 | Awareness logic adds the restriction of an awareness function to epistemic logic [Fitting] |
| Full Idea: Awareness logic enriched Hintikka's epistemic models with an awareness function, mapping each state to the set of formulas we are aware of at that state. This reflects some bound on the resources we can bring to bear. | |
| From: Melvin Fitting (Intensional Logic [2007], 3.6.1) | |
| A reaction: [He cites Fagin and Halpern 1988 for this] |
| 15379 | Justication logics make explicit the reasons for mathematical truth in proofs [Fitting] |
| Full Idea: In justification logics, the logics of knowledge are extended by making reasons explicit. A logic of proof terms was created, with a semantics. In this, mathematical truths are known for explicit reasons, and these provide a measure of complexity. | |
| From: Melvin Fitting (Intensional Logic [2007], 3.6.1) |
| 10751 | 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. |
| 10757 | 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. |
| 10759 | 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. |
| 11026 | Classical logic is deliberately extensional, in order to model mathematics [Fitting] |
| Full Idea: Mathematics is typically extensional throughout (we write 3+2=2+3 despite the two terms having different meanings). ..Classical first-order logic is extensional by design since it primarily evolved to model the reasoning of mathematics. | |
| From: Melvin Fitting (Intensional Logic [2007], §1) |
| 10753 | 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. |
| 10752 | Γ |- 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. |
| 10754 | 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. |
| 11028 | λ-abstraction disambiguates the scope of modal operators [Fitting] |
| Full Idea: λ-abstraction can be used to abstract and disambiguate a predicate. De re is [λx◊P(x)](f) - f has the possible-P property - and de dicto is ◊[λxP(x)](f) - possibly f has the P-property. Also applies to □. | |
| From: Melvin Fitting (Intensional Logic [2007], §3.3) | |
| A reaction: Compare the Barcan formula. Originated with Church in the 1930s, and Carnap 1947, but revived by Stalnaker and Thomason 1968. Because it refers to the predicate, it has a role in intensional versions of logic, especially modal logic. |
| 10756 | 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. |
| 10758 | 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'. |
| 10761 | 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) |
| 10755 | 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'. |
| 13128 | 'Ultimate sortals' cannot explain ontological categories [Westerhoff on Wiggins] |
| Full Idea: 'Ultimate sortals' are said to be non-subordinated, disjoint from one another, and uniquely paired with each object. Because of this, the ultimate sortal cannot be a satisfactory explication of the notion of an ontological category. | |
| From: comment on David Wiggins (Identity and Spatio-Temporal Continuity [1971], p.75) by Jan Westerhoff - Ontological Categories §26 | |
| A reaction: My strong intuitions are that Wiggins is plain wrong, and Westerhoff gives the most promising reasons for my intuition. The simplest point is that objects can obviously belong to more than one category. |
| 15377 | Definite descriptions pick out different objects in different possible worlds [Fitting] |
| Full Idea: Definite descriptions pick out different objects in different possible worlds quite naturally. | |
| From: Melvin Fitting (Intensional Logic [2007], 3.4) | |
| A reaction: A definite description can pick out the same object in another possible world, or a very similar one, or an object which has almost nothing in common with the others. |