Frederick > Recent Status Updates

Showing 1-5 of 5
Frederick
Frederick is on page 200 of 598 of Philosophy of Linguistics
Read editors info, then skipped to Bach and Chao's chapter on metaphysics. Now on Rooij's "meaning and use" chapter
Dec 18, 2013 04:10AM Add a comment
Philosophy of Linguistics

Frederick
Frederick is on page 36 of 312 of Accessing Kant: A Relaxed Introduction to the Critique of Pure Reason
R presents an infomorphism (Barwise and Seligman)! Numbers classifying two token heaps of apples can be added to a sum that classifies a combined heap, and the diagram commutes if you combine the heap then classify it. Reviewing R's summary of intelligibility in Kant's predecessors.
Dec 18, 2013 04:06AM Add a comment
Accessing Kant: A Relaxed Introduction to the Critique of Pure Reason

Frederick
Frederick is on page 11 of The Compositionality Papers
[in V, analytic philo 4] I'm interested in comparing their approach to Barwise, et al, who reject a First Order hypothesis for logical types.

"Compositionality is the property that a system of representation has when (1) it contains both primitive symbols and symbols that are syntactically and semantically complex; and (ii) the latter inherit their syntactic/semantic properties from the former."
Nov 29, 2013 07:54PM Add a comment
The Compositionality Papers

Frederick
Frederick is on page 11 of The Compositionality Papers
I'm interested in comparing their approach to that Barwise, Perry and Seligman, who reject a First Order hypothesis for logical types.

"Compositionality is the property that a system of representation has when (1) it contains both primitive symbols and symbols that are syntactically and semantically complex; and (ii) the latter inherit their syntactic/semantic properties from the former."
Nov 29, 2013 07:49PM Add a comment
The Compositionality Papers

Frederick
Frederick is on page 91 of 292 of Information Flow: The Logic of Distributed Systems (Cambridge Tracts in Theoretical Computer Science, Series Number 44)
Invariants on p84 are defined with a Relation R that does not have to be and equivalence class (just take the Reflx-Sy-Tr closure if you need one). But dual invariants on p 87 are defined on R-equiv classes of types. Why?
Nov 28, 2013 07:52PM Add a comment
Information Flow: The Logic of Distributed Systems (Cambridge Tracts in Theoretical Computer Science, Series Number 44)

Follow Frederick's updates via RSS