There are two principles which bear the name Frege''sprinciple: the principle of compositionality, and the contextprinciple. The aim of this contribution is to investigate whether thisis justified: did Frege accept both principles at the same time, did hehold the one principle but not the other, or did he, at some moment,change his opinion? The conclusion is as follows. There is a developmentin Frege''s position. In the period of Grundlagen he followed to a strict form of contextuality. He repeatedcontextuality in later (...) writings, but became less strict. From 1914 on,pushed by the needs of research, he comes close to compositionality. Buthe could never make the final step toward compositionality forprincipled reasons, therefore he always would reject compositionality. (shrink)

In this paper, we present a prenex form theorem for a version of Independence Friendly logic, a logic with imperfect information. Lifting classical results to such logics turns out not to be straightforward, because independence conditions make the formulas sensitive to signalling phenomena. In particular, nested quantification over the same variable is shown to cause problems. For instance, renaming of bound variables may change the interpretations of a formula, there are only restricted quantifier extraction theorems, and slashed connectives cannot be (...) so easily removed. Thus we correct some claims from Hintikka [8], Caicedo & Krynicki [3] and Hodges [11]. We refine definitions, in particular the notion of equivalence, and sharpen preconditions, allowing us to restore those claims, including the prenex form theorem of Caicedo & Krynicki [3], and, as a side result, we obtain an application to Skolem forms of classical formulas. It is a known fact that a complete calculus for IF-logic is impossible, but with our results we establish several quantifier rules that form a partial calculus of equivalence for a general version of IF-logic reflecting general properties of information flow in games. (shrink)

In this paper it is argued that Hintikka's game theoreticalsemantics for Independence Friendly logic does not formalize theintuitions about independent choices; it rather is aformalization of imperfect information. Furthermore it is shownthat the logic has several remarkable properties (e.g.,renaming of bound variables is not allowed). An alternativesemantics is proposed which formalizes intuitions aboutindependence.

Research and engineering in the quantum domain involve long chains of activity involving theory development, hypothesis formation, experimentation, device prototyping, device testing, and many more. At each stage multiple paths become possible, and of the paths pursued, the majority will lead nowhere. Our quantum metascience approach provides a strategy which enables all stakeholders to gain an overview of those developments along these tracks, that are relevant to their specific concerns. It provides a controlled vocabulary, built out of terms that are (...) designed to be maximally comprehensible to all groups of stakeholders and across all the sub-fields of the quantum domain. (shrink)

A Theory of Truth and Semantic Representation Hans Kamp. INTRODUCTION Two conceptions of meaning have dominated formal semantics of natural language. ...

Independence Friendly Logic, introduced by Hintikka, is a logic in which a quantifier can be marked for being independent of other quantifiers. Dependence logic, introduced by Väänänen, is a logic with the complementary approach: for a quantifier it can be indicated on which quantifiers it depends. These logics are claimed to be useful for many phenomena, for instance natural language semantics. In this contribution we will compare these two logics by investigating their application in a compositional analysis of the de (...) dicto - de re ambiguity in natural language. It will be argued that Independence Friendly logic is suitable, whereas Dependence Logic is not. (shrink)

Various restrictions on transformational grammars have been investigated in order to reduce their generative power from recursively enumerable languages to recursive languages.It will be shown that any restriction on transformational grammars defining a recursively enumerable subset of the set of all transformational grammars, is either too weak (in the sense that there does not exist a general decision procedure for all languages generated under such a restriction) or too strong (in the sense that there exists a recursive language that cannot (...) be generated by any transformational grammar thus restricted). In addition, some related problems will be discussed. (shrink)

On savait que c’était l’entité la plus complexe de l’univers connu. Mais le feu d’artifice de découvertes récentes dépasse l’entendement et fait exploser tous les schémas. Votre cerveau est (beaucoup) plus fabuleux que vous le croyez. Il est : totalement élastique, même âgé, handicapé, voire amputé de plusieurs lobes, le système nerveux central peut se reconstituer et repartir à l’assaut des connaissances et de l’action sur le monde ; totalement social, un cerveau n’existe jamais seul, mais toujours en résonance avec (...) d’autres. Mieux : nous sommes neuronalement constitués pour entrer en empathie avec autrui et aller à son secours. Ce livre aborde ces questions passionnantes avec cinq spécialistes. (shrink)