green numbers give full details | back to texts | unexpand these ideas
15375 | If terms change their designations in different states, they are functions from states to objects |
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 |
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 |
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 |
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) |
11026 | Classical logic is deliberately extensional, in order to model mathematics |
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) |
11028 | λ-abstraction disambiguates the scope of modal operators |
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. |
15377 | Definite descriptions pick out different objects in different possible worlds |
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. |