The aim of this paper is to argue that the (alleged) indeterminism of quantum mechanics, claimed by adherents of the Copenhagen interpretation since Born (1926), can be proved from Chaitin's follow-up to Goedel's (first) incompleteness theorem. In comparison, Bell's (1964) theorem as well as the so-called free will theorem-originally due to Heywood and Redhead (1983)-left two loopholes for deterministic hidden variable theories, namely giving up either locality (more precisely: local contextuality, as in Bohmian mechanics) or free choice (i.e. uncorrelated measurement (...) settings, as in 't Hooft's cellular automaton interpretation of quantum mechanics). The main point is that Bell and others did not exploit the full empirical content of quantum mechanics, which consists of long series of outcomes of repeated measurements (idealized as infinite binary sequences): their arguments only used the long-run relative frequencies derived from such series, and hence merely asked hidden variable theories to reproduce single-case Born probabilities defined by certain entangled bipartite states. If we idealize binary outcome strings of a fair quantum coin flip as infinite sequences, quantum mechanics predicts that these typically (i.e. almost surely) have a property called 1-randomness in logic, which is much stronger than uncomputability. This is the key to my claim, which is admittedly based on a stronger (yet compelling) notion of determinism than what is common in the literature on hidden variable theories. (shrink)

This is a joint review of Jenann Ismael's 'How physics makes us free' (OUP).

In a series of articles we try to show the need of a novel Theory for Theory of Computation based on considering time as a Fuzzy concept. Time is a central concept In Physics. First we were forced to consider some changes and modifications in the Theories of Physics. In the second step and throughout this article we show the positive Impact of this modification on Theory of Computation and Complexity Theory to rebuild it in a more successful and fruitful (...) approach. We call this novel Theory TC*. (shrink)

Here, the author tries to build the structure of the Theory of computation based on considering time as a fuzzy concept. In fact, there are reasons to consider time as a fuzzy concept. In this article, the author doesn’t go to this side but note that Brower and Husserl views on the concept of time were similar [8]. Some reasons have been given for it in [3]. Throughout this article, the author presents the Theory of Computation with Fuzzy Time. Given (...) the classic definition of Turing Machine, the concept of Time is modified to Fuzzy time. This new term calls as Theory TC* [2] and this type of computation “Fuzzy time Computation”. We have relatively large number of fundamental unsolved problems in Complexity Theory. In the new theory, some of the major obstacles and unsolved problems have been solved [2]. It should be noted that in this article, the writer considers fuzzy number associated to instants of time as a symmetric one. The point about the symmetry is in the proof of Lemma 3, although it is generalizable. In particular, the new classes of complexity Theory, P*, NP*, BPP* in the TC* analogues to the definitions of P, NP, BPP defines as their natural alternative definition. Here, we will see P*≠ NP*, P*= BPP*. Finally, we have Theorem 4. (shrink)

Here, we try to build the structure of a Theory of computation based on considering time as a fuzzy concept. Actually, there are some reasons to consider time as a fuzzy concept. In this article, we don’t go to this side but we remind that Brower and Husserl ideas about the concept of time were similar [14]. Throughout this article, we present the Theory of Computation with Fuzzy Time. Considering the classical definition of Turing Machine we change and modify the (...) concept of Time to Fuzzy time. We call this new Theory TC* and this type of computation “Fuzzy time Computation”. We have relatively large number of fundamental unsolved problems in Complexity Theory. In the new Theory some of the major obstacles and unsolved problems are solved. It should be mentioned that in this article, we consider fuzzy number a symmetric one. The point about the symmetry is in the proof of Lemma 3, although we are able to generalize it. More specifically, we define the new classes of complexity Theory, P*, NP*, BPP* in TC* analogues to the definitions P, NP, BPP as their natural substituted definition. We show P*≠ NP*, P*= BPP*. Finally, we have Theorem 4, P≠NP . (shrink)

A proof for P=NP in modal logic. What it takes to simulate all particles in the universe correctly.

My review summarizes the book's constituent papers, with occasional brief comments. All of the contributions are competent and interesting.

We have shown the plausibility of considering time as a Fuzzy concept instead of classical time [7], [8]. By considering time as a fuzzy concept, we will have new classes of Complexity. Here, we show that how some famous problems will be solved in this new picture.

The CMI Millennium “P vs NP Problem” can be resolved e.g. if one shows at least one counterexample to the "P = NP" conjecture. A certain class of problems being such counterexamples will be formulated. This implies the rejection of the hypothesis that "P = NP" for any conditions satisfying the formulation of the problem. Thus, the solution "P is different from NP" of the problem in general is proved. The class of counterexamples can be interpreted as any quantum superposition (...) of any finite set of quantum states. The Kochen-Specker theorem is involved. Any fundamentally random choice among a finite set of alternatives belong to "NP" but not to "P". The conjecture that the set complement of "P" to "NP" can be described by that kind of choice exhaustively is formulated. (shrink)

Abstract The Theory of Computation in its existed form is based on Church –Turing Thesis. Throughout this paper, we show that the Turing computation model of this theory leads us to a contradiction. In brief, by applying a well-known paradox (Unexpected hanging paradox) we show a contradiction in the Theory when we consider the Turing model as our Computation model.

While I was working about some basic physical phenomena, I discovered some geometric relations that also interest mathematics. In this work, I applied the rules I have been proven to P=NP? problem over impossibility of perpendicularity in the universe. It also brings out extremely interesting results out like imaginary numbers which are known as real numbers currently. Also it seems that Euclidean Geometry is impossible. The actual geometry is Riemann Geometry and complex numbers are real.

Here, by introducing a version of “Unexpected hanging paradox” first we try to open a new way and a new explanation for paradoxes, similar to liar paradox. Also, we will show that we have a semantic situation which no syntactical logical system could support it. Finally, we propose a claim in Theory of Computation about the consistency of this Theory. One of the major claim is:Theory of Computation and Classical Logic leads us to a contradiction.

We argue that there exist two kinds of passive structures, a) one generated in the base b) the other transformationally derived by the structure preserving-rule of move-NP. Assuming a Case theory along the lmines of Chomsky (1978), we want to argue a) that some oblique Cases are assigned in the base b) that NP movement can move an oblique Case assigned in the base c) that movement should not be defined in terms of Case but in terms of Government.

Throughout this paper, we prove TC + CON(TC*)ͰP ≠ NP. To do that, firstly we introduce the definition of scope∗ . This definition is based on the practical situation of computation in the real world. In the real world and real computational activities, we face finite number of efficient computable functions which work in a limited time. Inspired by this fact and considering time as a fuzzy concept, we have the definition. By employing this definition, we reach to a world (...) of computation, in which our time is non-classical and fuzzy, so we have random generations, but the set of all computations (our computational world) is the same as we have in classical time (TC). The result will be P ≠ NP and P* ≠ NP*. Throughout this article, we discuss around the impact of TC* on TC. (shrink)

Here we discuss about the following results: 1.

Throughout this paper, we prove TC+CON(〖TC〗^* )ͰP≠NP. To do that, firstly, we introduce the definition of scope_^*. This definition is based on the practical situation of computation in the real world. In the real world and real computational activities, we face a finite number of efficiently computable functions which work in a limited time. Inspired by this fact and considering time as a fuzzy concept, we have the definition. By employing this definition, we reach to a world of computation, in (...) which our time is non-classical and fuzzy, so we have random generations, but the set of all computations (our computational world) is the same as we have in classical time (TC). The result will be P≠NP and 〖 P〗^*≠NP^*. Throughout this article, we discuss around the impact of TC^* on TC. (shrink)

I prove both the mathematical conjectures P ≠ NP and the Continuum Hypothesis are eternally unprovable using the same fundamental idea. Starting with the Saunders Maclane idea that a proof is eternal or it is not a proof, I use the indeterminacy of human biological capabilities in the eternal future to show that since both conjectures are independent of Axioms and have definitions connected with human biological capabilities, it would be impossible to prove them eternally without the creation and widespread (...) acceptance of new axioms. I also show that the same fundamental concepts cannot be used to demonstrate the eternal unprovability of many other mathematical theorems and open conjectures. Finally I investigate the idea’s implications for the foundations of mathematics including its relation to Godel’s Incompleteness Theorem and Tarsky’s Undefinability Theorem. (shrink)

NPs with intensional relative clauses such as 'the impact of the book John needs to write' pose a significant challenge for trope theory (the theory of particularized properties), since they seem to refer to tropes that lack an actual bearer. This paper proposes a novel semantic analysis of such NPs on the basis of the notion of a variable object. The analysis avoids a range of difficulties that an alternative analysis based on the notion of an individual concept would face.

NPs with intensional relative clauses such as 'the book John needs to write' pose a significant challenge for semantic theory. Such NPs act like referential terms, yet they do not stand for a particular actual object. This paper will develop a semantic analysis of such NPs on the basis of the notion of a variable object. The analysis avoids a range of difficulties that a more standard analysis based on the notion of an individual concept would face. Most importantly, unlike (...) the latter, the proposed analysis can be carried over NPs such as 'the number of people that fit into the bus', which describe tropes (particularized properties). (shrink)

I provide the account of divine creation found in multiverse theorists Donald Turner, Klaas Kraay, and Tim O’Connor. I show that the accounts Kraay and Turner offer are incoherent. God does not survey all possible worlds and necessarily actualize those universes in the (on balance) good worlds or the worthy worlds. If God necessarily actualizes the multiverse, we have no idea which universes are parts of that multiverse. I show next that Tim O’Connor’s multiverse account of creation is also (...) incoherent. I argue that a preferable multiverse would include a much greater variety of universes than are included in Turner, Kraay or O’Connor. In the last section I offer some concluding remarks. (shrink)

Neuroelectrical panpsychism (NP) offers a clear, simple, testable mind–body solution. It says that everything is at least minimally conscious, and electrical activity across separate neurons creates a unified, intelligent mind. NP draws on recent experimental evidence to address the easy problem of specifying the mind's neural correlates. These correlates are neuroelectrical activities that, for example, generate our different qualia, unite them to form perceptions and emotions, and help guide brain operations. NP also addresses the hard problem of why minds accompany (...) these neural correlates. Here, the real nature of matter-energy (beyond how it appears to sense organs) is consciousness that occupies space, exerts forces, and unites neuroelectrically to form minds. This doesn't reduce consciousness to observable neural activities, nor posit any radically different entities. NP also deals with panpsychism's combination problem by explaining how the mind's subject and experiences arise by electrically combining simple experiences in brains. (shrink)

Recent work in the philosophy of religion has resurrected Leibniz’s idea that there is a best possible world, perhaps ours. In particular, Klaas Kraay’s [2010] construction of a theistic multiverse and Nevin Climenhaga’s [2018] argument from infinite value theory are novel defenses of a best possible world. I do not think that there is a best world, and show how both Kraay and Climenhaga may be resisted. First, I argue that Kraay’s construction of a theistic multiverse can be resisted (...) from plausible assumptions about set theory. Next, I argue against the value-theoretic assumptions that underlie Climenhaga’s argument and show how to give an infinite value theory where there is no best world. (shrink)

In replying to certain objections to the existence of God, Robert Adams, Bruce Langtry, and Peter van Inwagen assume that God can appropriately choose a suboptimal world, a world less good than some other world God could have chosen. A number of philosophers, such as Michael Slote and Klaas Kraay, claim that these theistic replies are therefore committed to the claim that satisficing can be appropriate. Kraay argues that this commitment is a significant liability. I argue, however, that the (...) relevant defenses of theism are committed to the appropriateness of, not satisficing, but motivated submaximization. When one submaximizes with motivation, one aims at the optimum but accepts the good enough because of a countervailing consideration. When one satisfices, one aims at the good enough and chooses the good enough because it realizes her aim at the good enough. While commitment to the appropriateness of satisficing may be a significant liability, commitment to the appropriateness of motivated submaximization is not. (shrink)

This paper argues that NPs with case as head noun stand for situations in their role as truthmakers within a sentential or epistemic case space. The paper develops a unified semantic analysis of case-constructions of the various sorts within a truthmaker-based version of alternative semantics.

FDE, LP and K3 are closely related to each other and admit of an intuitive informational interpretation. However, all these logics are co-NP complete, and so idealized models of how an agent can think. We address this issue by shifting to signed formulae, where the signs express imprecise values associated with two bipartitions of the corresponding set of standard values. We present proof systems whose operational rules are all linear and have only two structural branching rules that express a generalized (...) Principle of Bivalence. Each of these systems leads to defining an infinite hierarchy of tractable approximations to the respective logic, in terms of the maximum number of allowed nested applications of the two branching rules. Further, each resulting hierarchy admits of an intuitive 5-valued non-deterministic semantics. (shrink)

One of the possible hypotheses about time is to consider any instant of time as fuzzy number, so that two instants of time could be overlapped. Historically, some Mathematicians and Philosophers have had similar ideas like Brouwer and Husserl [5]. Throughout this article, the impact of this change on Theory of Computation and Complexity Theory are studied. In order to rebuild Theory of Computation in a more successful and productive approach to solve some major problems in Complexity Theory, the present (...) research is done. This novel theory is called here, the fuzzy time theory of computation, TC^*. (shrink)

This paper will focus on a philosophically significant construction whose semantics brings together two important notions in Kit Fine’s philosophy, the notion of truthmaking and the notion of a variable embodiment, or its extension, namely what I call a ‘variable object’. This is the construction of definite NPs like 'the number of people that can fit into the bus', 'the book John needs to write', and 'the gifted mathematician John claims to be'. Such NPs are analysed as standing for variable (...) objects, which are part of the 'shallow', construction-driven ontology of natural language, yet are real. (shrink)

We recall, "a priori," numeric energy expression: -/- Energy Numbers -/- $\begin{gathered}\mathcal{V}=\left\{f \mid \exists\left\{e_1, e_2, \ldots, e_n\right\} \in E \cup R\right\} \\ \mathcal{V}=\left\{f \mid \exists\left\{e_1, e_2, \ldots, e_n\right\} \in E, \text { and }: E \mapsto r \in R\right\} \\ \mathcal{V}=\left\{E \mid \exists\left\{a_1, \ldots, a_n\right\} \in E, E \not \neg r \in R\right\}\end{gathered}$ -/- We now introduce the set of optimized energy numbers: -/- ($H_a \in \mathcal{H}$ or $P^n = NP$ or $(P,\mathcal{L},F) = NP$). -/- Based on our formulation of (...) the bi-objective optimization task, we can make the following mathematical inferences: -/- 1. If the optimized energy numbers set $\mathcal{N}_H$ is equal to the original energy numbers set $\mathcal{E}$, i.e. $\mathcal{N}_H = \mathcal{E}$, then the maximum optimization score is achieved, i.e. the bi-objective optimization task is solved. This implies that there exists at least one solution to the optimization problem and $H_a \in \mathcal{H}$, where $H_a$ is the hypothesis that states the existence of an efficient algorithm to solve the problem. -/- 2. If the optimized energy numbers set $\mathcal{N}_H$ is a subset of the original energy numbers set $\mathcal{E}$, i.e. $\mathcal{N}_H \subset \mathcal{E}$, then the optimization score is less than the maximum score. This indicates that there may exist more efficient algorithms to solve the problem, and the hypothesis $H_a$ is still possible. -/- 3. If the optimized energy numbers set $\mathcal{N}_H$ is a superset of the original energy numbers set $\mathcal{E}$, i.e. $\mathcal{N}_H \supset \mathcal{E}$, then the optimization score is higher than the maximum score. This implies that the optimization problem may be easier than initially thought, and $P^n = NP$, or at least some form of $NP$-completeness. -/- 4. If the optimized energy numbers set $\mathcal{N}_H$ is a strict subset of the original energy numbers set $\mathcal{E}$, i.e. $\mathcal{N}_H \subsetneq \mathcal{E}$, and $P^n \neq NP$, then it can be concluded that the optimization problem is complex but there may exist algorithms that can efficiently approximate the solution. -/- 5. If the optimized energy numbers set $\mathcal{N}_H$ is empty, i.e. $\mathcal{N}_H = \emptyset$, then it can be inferred that the optimization problem is infeasible, i.e. no efficient algorithm exists to solve it, and $H_a$ is false. -/- 6. Comparing the two objectives in the bi-objective optimization task, we can make the following statements: -/- - The first objective, $\frac{\delta_{v(f)}(\mathbf{v}, \mathbf{w_{max}})} {\langle \mathbf{v_f}, \mathbf{1_f}\rangle}$, measures the efficiency of the algorithm and its ability to find low energy numbers. - The second objective, $\rho(\mathcal{N}_H)$, measures the accuracy of the algorithm in terms of loss and perplexity on the HyperLanguageModel. - Therefore, by optimizing both objectives simultaneously, we aim to find an efficient algorithm that also minimizes the loss and perplexities on the HyperLanguageModel. - If the optimization task is successfully solved, then the algorithm achieves both high efficiency and high accuracy. This would imply that the algorithm is able to find low energy numbers effectively and also generalize well on the HyperLanguageModel. -/- The optimized energy numbers aim to find a set of numbers $\mathbf{v}$ that maximize the bi-objective optimization task, while also minimizing the loss and perplexity of the HyperLanguageModel. This is achieved by finding the set of numbers that have the highest delta value and the lowest perplexity, resulting in a more optimized and efficient set of energy numbers. -/- By comparing the optimized energy numbers to the original set, we can see that the optimized set may have a higher delta value and a lower perplexity, indicating that it is a better set of numbers for the given task. This shows that the optimized energy numbers have successfully achieved their goal of maximizing efficiency while minimizing loss and perplexity. (shrink)

Proper names are generally taken to be count nouns. This paper argues that this is mistaken and that at least in some languages, for example German, names divide into mass and count. Making use of Kayne's (2005, 2010) theory of light nouns, this paper argues that light nouns are part of (simple) names and that a mass-count distinction among light nouns explains the behavior of certain types of names in German as mass rather than count. The paper elaborates the role (...) of light nouns with new generalizations regarding their linguistic behavior in quantificational and pronominal NPs, their selection of relative pronouns in German, and a general difference in the support of plural anaphora between English and German. (shrink)

I propose some rules that regiment substitutions of NPs.

Modal logic is one of philosophy’s many children. As a mature adult it has moved out of the parental home and is nowadays straying far from its parent. But the ties are still there: philosophy is important to modal logic, modal logic is important for philosophy. Or, at least, this is a thesis we try to defend in this chapter. Limitations of space have ruled out any attempt at writing a survey of all the work going on in our field—a (...) book would be needed for that. Instead, we have tried to select material that is of interest in its own right or exemplifies noteworthy features in interesting ways. Here are some themes that have guided us throughout the writing: • The back-and-forth between philosophy and modal logic. There has been a good deal of give-and-take in the past. Carnap tried to use his modal logic to throw light on old philosophical questions, thereby inspiring others to continue his work and still others to criticise it. He certainly provoked Quine, who in his turn provided—and continues to provide—a healthy challenge to modal logicians. And Kripke’s and David Lewis’s philosophies are connected, in interesting ways, with their modal logic. Analytic philosophy would have been a lot different without modal logic! • The interpretation problem. The problem of providing a certain modal logic with an intuitive interpretation should not be conflated with the problem of providing a formal system with a model-theoretic semantics. An intuitively appealing model-theoretic semantics may be an important step towards solving the interpretation problem, but only a step. One may compare this situation with that in probability theory, where definitions of concepts like ‘outcome space’ and ‘random variable’ are orthogonal to questions about “interpretations” of the concept of probability. • The value of formalisation. Modal logic sets standards of precision, which are a challenge to—and sometimes a model for—philosophy. Classical philosophical questions can be sharpened and seen from a new perspective when formulated in a framework of modal logic. On the other hand, representing old questions in a formal garb has its dangers, such as simplification and distortion. • Why modal logic rather than classical (first or higher order) logic? The idioms of modal logic—today there are many!—seem better to correspond to human ways of thinking than ordinary extensional logic. (Cf. Chomsky’s conjecture that the NP + VP pattern is wired into the human brain.) In his An Essay in Modal Logic (1951) von Wright distinguished between four kinds of modalities: alethic (modes of truth: necessity, possibility and impossibility), epistemic (modes of being known: known to be true, known to be false, undecided), deontic (modes of obligation: obligatory, permitted, forbidden) and existential (modes of existence: universality, existence, emptiness). The existential modalities are not usually counted as modalities, but the other three categories are exemplified in three sections into which this chapter is divided. Section 1 is devoted to alethic modal logic and reviews some main themes at the heart of philosophical modal logic. Sections 2 and 3 deal with topics in epistemic logic and deontic logic, respectively, and are meant to illustrate two different uses that modal logic or indeed any logic can have: it may be applied to already existing (non-logical) theory, or it can be used to develop new theory. (shrink)

This essay presents a philosophical and computational theory of the representation of de re, de dicto, nested, and quasi-indexical belief reports expressed in natural language. The propositional Semantic Network Processing System (SNePS) is used for representing and reasoning about these reports. In particular, quasi-indicators (indexical expressions occurring in intentional contexts and representing uses of indicators by another speaker) pose problems for natural-language representation and reasoning systems, because--unlike pure indicators--they cannot be replaced by coreferential NPs without changing the meaning of the (...) embedding sentence. Therefore, the referent of the quasi-indicator must be represented in such a way that no invalid coreferential claims are entailed. The importance of quasi-indicators is discussed, and it is shown that all four of the above categories of belief reports can be handled by a single representational technique using belief spaces containing intensional entities. Inference rules and belief-revision techniques for the system are also examined. (shrink)

Konserwatywni przeciwnicy prowadzenia badań naukowych na ludzkich embrionach argumentują, że od momentu poczęcia mają one status moralny równy statusowi ludzi dorosłych: zarodki mają takie samo prawo do życia jak dorośli. W artykule przedstawiam oryginalną argumentację za tym stanowiskiem, której źródła można znaleźć w XVII-wiecznej teologii moralnej i współczesnej teorii decyzji. Argumentacja ta nie odwołuje się do statusu ontologicznego embrionów, ale do pewnego typu rozumowania praktycznego na temat tego, co należy robić w rozmaitych sytuacjach niepewności. Na pierwszy rzut oka wydaje się (...) ona wzmacniać stanowisko konserwatywne, ponieważ nie zależy od kontrowersyjnych metafizycznych założeń na temat statusu zarodków czy kwestii ich potencjalności. W artykule pokażę jednak, że argumentacja ta obarczona jest poważnymi wadami, które sprawiają, że nie da się jej zastosować do uzasadnienia sprzeciwu wobec moralnej czy prawnej dopuszczalności np. badań na zarodkowych komórkach macierzystych. (shrink)

David Lewis (1980) proposed the Principal Principle (PP) and a “reformulation” which later on he called ‘OP’ (Old Principle). Reacting to his belief that these principles run into trouble, Lewis (1994) concluded that they should be replaced with the New Principle (NP). This conclusion left Lewis uneasy, because he thought that an inverse form of NP is “quite messy”, whereas an inverse form of OP, namely the simple and intuitive PP, is “the key to our concept of chance”. I argue (...) that, even if OP should be discarded, PP need not be. Moreover, far from being messy, an inverse form of NP is a simple and intuitive Conditional Principle (CP). Finally, both PP and CP are special cases of a General Principle (GP); it follows that so are PP and NP, which are thus compatible rather than competing. (shrink)

This thesis explores the syntax and semantics of coordinate structures on the basis of three-dimensional syntactic structures. In particular it gives an analysis of sentences of the sort 'a man came and a woman left who knew each other well' on the basis of implicit coordination of NPs, made available within three-dimensionional syntactic structures..

The purpose of this paper is to describe the use of cognitive convenience in color naming and to find possible cognitive, physical, pragmatic, and logical reasons for such a phenomenon. By the term cognitive convenience, we mean the naming of or referring to objects of a certain color, for which their hue is not as important as their brightness, in which case, they might fall under another focal color. For example, in various languages, grapes are “white” and “black”, even though (...) their real hue is usually a certain shade of green or purple. Along with a brief typological comparison of examples of cognitive convenience in unrelated languages, we report the results of a survey demonstrating that vagueness and brightness context influenced color naming, thus confirming our main hypotheses. We concluded that in conversation, the main criterion for choosing and identifying a referent of an NP with a color adjective—when the choice is based on color—is the proximity of its shade to the prototypical shade of the named color. In this process, contextual factors may affect the speaker’s and hearer’s preciseness. We claim that this phenomenon can be explained not only from a philosophical and pragmatic standpoint, but from an information-entropy standpoint as well. For an overall unifying theory, we will connect the informational entropy to the pragmatic notion of semantic vagueness and then inspect the overall choice of a fuzzy predicate logic that is able to incorporate such references. (shrink)

This paper is an example of how contextual information interacts with the interpretation of noun phrases (NPs) in discourse. When we encounter an NP escorted by the definite article or a proper name, the expectation is triggered that the speaker is referring to some referent x that the hearer can normally identify. Strawson and Russell have agreed that a referent must be associated with a definite description so that the assertion containing it can be said to be true. In the (...) case where a description does not refer to anything, the assertion is considered by Russell to be false, while Strawson says that the issue of truth or falsity does not arise. In this paper, we examine a case in which contextual information interacts with the interpretation of NPs in discourse and the hearer is not expected to identify a referent when hearing a proper name. In this case, the issue of truth or falsity does not arise, because the hearer does not identify the referent. In fact, s/he does not intend for the discourse to about a referent at all. These situations are primarily represented by sentences uttered during the course of a grammar lecture, in which the lecturer is explaining a rule of language and does not focus on external reality. The hearers are aware of this focus and do not process the NP (in general a proper name) to identify a specific referent. This discourse is of three types, which will be discussed at the end of this paper. -/- Keywords: reference; pragmeme; presupposition; fictional discourse; exemplification acts. (shrink)

This paper presents a theory of situated part structures involving the notion of an integrated and not just a part-of relation. The theory is applied in particular to the semantics of the modifiers 'whole' and 'individual', as in 'the whole collection' and 'the individual students'. The adnominal modifiers 'whole' and 'individual' have been entirely been ignored in the linguistic and philosophical literature, even though they pose significant challenges for standard views of reference, of the semantics of referential NPs, and for (...) ontology (the exception being medieval philosophy of language where 'whole' has received significant attention). 'Whole' strikingly displays two opposite readings: 'The whole collection is expensive' can mean - 'as a whole' or 'every part'. The paper proposes that the two readings be traced to two different conceptions of part structures of objects: one according to which the parts of an objects are just the material parts and another, Aristotelian conception according to which the parts of an object include properties of form. (shrink)

This chapter is concerned with plural discourse in the grammatical sense. The goal of the chapter is to urge the value of the event analysis of the matrix of action sentences in thinking about logical form in plural discourse about action. Among the claims advanced are that: -/- 1. The ambiguity between distributive and collective readings of plural action sentences is not lexical ambiguity, either in the noun phrase (NP) or in the verb phrase (VP), but an ambiguity tracing to (...) the scope of the event quantifier introduced by the action verb. 2. This allows us to analyze collective action sentences in a way that commits us only to individual agents acting when we say that groups act, without denying that there are groups as such or that we talk about them as such. 3. Intermediate readings, that seem to be neither purely distributive nor purely collective, can be explained in terms of the same apparatus. (shrink)

Artykuł traktuje w zarysie o istocie i głównych modelach power-sharing. Choć powersharing może być pojmowane w sposób bardzo szeroki, tematyka tego artykułu dotyczy jego wąskiego rozumienia. Odnosi się ono do fenomenu dzielenia się władzą państwową przez różne segmenty (np. grupy etniczne lub wspólnoty religijne) społeczeństw pluralnych (podzielonych, sfragmentaryzowanych), w tym zwłaszcza wieloetnicznych i/lub wieloreligijnych. Głównym celem artykułu jest wyjaśnienie treści power-sharing we wskazanym wąskim rozumieniu i wytłumaczenie w zarysie jego głównych modeli (konfesjonalizm, model Lewisa, konsocjonalizm, centrypetalizm).

The paper introduces and utilizes a few new concepts: “nonstandard Peano arithmetic”, “complementary Peano arithmetic”, “Hilbert arithmetic”. They identify the foundations of both mathematics and physics demonstrating the equivalence of the newly introduced Hilbert arithmetic and the separable complex Hilbert space of quantum mechanics in turn underlying physics and all the world. That new both mathematical and physical ground can be recognized as information complemented and generalized by quantum information. A few fundamental mathematical problems of the present such as Fermat’s (...) last theorem, four-color theorem as well as its new-formulated generalization as “four-letter theorem”, Poincaré’s conjecture, “P vs NP” are considered over again, from and within the new-founding conceptual reference frame of information, as illustrations. Simple or crucially simplifying solutions and proofs are demonstrated. The link between the consistent completeness of the system mathematics-physics on the ground of information and all the great mathematical problems of the present (rather than the enumerated ones) is suggested. (shrink)

We investigate the theory IΔ 0 + Ω 1 and strengthen [Bu86. Theorem 8.6] to the following: if NP ≠ co-NP. then Σ-completeness for witness comparison formulas is not provable in bounded arithmetic. i.e. $I\delta_0 + \Omega_1 + \nvdash \forall b \forall c (\exists a(\operatorname{Prf}(a.c) \wedge \forall = \leq a \neg \operatorname{Prf} (z.b))\\ \rightarrow \operatorname{Prov} (\ulcorner \exists a(\operatorname{Prf}(a. \bar{c}) \wedge \forall z \leq a \neg \operatorname{Prf}(z.\bar{b})) \urcorner)).$ Next we study a "small reflection principle" in bounded arithmetic. We prove that for (...) all sentences φ $I\Delta_0 + \Omega_1 \vdash \forall x \operatorname{Prov}(\ulcorner \forall y \leq \bar{x} (\operatorname{Prf} (y. \overline{\ulcorner \varphi \urcorner}) \rightarrow \varphi)\urcorner).$ The proof hinges on the use of definable cuts and partial satisfaction predicates akin to those introduced by Pudlak in [Pu86]. Finally, we give some applications of the small reflection principle, showing that the principle can sometimes be invoked in order to circumvent the use of provable Σ-completeness for witness comparison formulas. (shrink)

Integracja wiekowa - termin stosowany w gerontologii społecznej w przynajmniej dwóch znaczeniach. W ujȩciu w¸a}skim - przyjȩtym głównie w literaturze anglojȩzycznej - integracja wiekowa odnosi siȩ do takiej struktury ról społecznych w różnorodnych instytucjach, która umożliwia istnienie różnic, ale nie s¸a} one zależne ściśle od struktury wieku, tj. tego czy ktoś jest osob¸a} młod¸a}, w wieku środkowym, czy też w wieku starszym. Chodzi tutaj w szczególności o instytucje edukacyjne, ekonomiczne, polityczne, religijne i czasu wolnego w których osoby z odmiennych grup (...) wieku i generacji odgrywaj¸a rozmaite role i zajmuj¸a różne pozycje. Integracja wiekowa opiera siȩ na założeniu, że dostȩp do instytucji, możliwości wyjścia z niej i dostȩp do produktów ; zrealizowanych w rzeczywistości usług i wypłaconych świadczeń oraz rezultatów ; efektów zrealizowanych usług i świadczeń np. zmniejszenie ubóstwa, poprawa stanu zdrowia, działalności tych instytucji jest równy dla wszystkich bez wzglȩdu na wiek. ** Age integration - a term used in social gerontology in at least two senses. In a narrow perspective - adopted mainly in English-language literature - age integration refers to such a structure of social roles in various institutions that allows for differences, but they do not depend strictly on the age structure, i.e. whether someone is a middle-aged adult or in an older age. This is particularly about educational, economic, political, religious and leisure institutions in which people from different age groups and generations play different roles and occupy different positions. Age integration is based on the assumption that access to the institution, the possibility of exiting it and access to products ; services implemented in reality and benefits and outcomes paid out; the effects of implemented services and services, eg reduction of poverty, improvement of health, activities of these institutions is equal for all regardless of age. (shrink)

The author examines the arguments for applicability of the limitation clause which specifies the requirements for limitation of constitutional freedoms and rights (Article 31 para. 3 of the Constitution) to the right to protection of life (Article 38). Even if there is almost a general acceptance of such applicability, this approach does not hold up to criticism based on the rule existing in the Polish legal order that treaty commitments concerning human rights have supremacy over national statutory regulations. Due to (...) an international pattern which does not provide application of the limitation clause to the right to life protection, despite the recognition — at the level of a constitutional standard — of applicability of the clause of Article 31 para. 3 to Article 38, and to protection of life in general, this will be made impossible at any attempt to formulate a statutory standard. He also points out the defectiveness of the reasoning leading to acceptance of certain limitations of a particular value (e.g. life) on the basis of the ex definitione exemptions existing in the international standard to the assumption of applicability of the limitation clause when shaping statutory standards in the Polish legal system. The discussed issues are related to the question of interpretation of the inviolability of human rights. This term takes different meaning in the context of: 1) inviolability of all human rights understood in abstracto as normative structures of a general and abstract nature; 2) right protecting certain values with no exception; 3) rights to which an application of the limitation clause is forbidden; 4) rights not subject to derogation; 5) inviolability of understood in concreto, as that is (here and now) due to the subject of dignity; 6) inviolable essence of freedoms and rights. One should also clearly distinguish between (7) the descriptive and (8) the normative meaning of inviolability. -/- Punktem wyjścia jest analiza argumentacji na rzecz tezy o stosowalności do prawa do ochrony życia (art. 38 Konstytucji RP), klauzuli limitacyjnej określającej warunki ograniczania konstytucyjnych wolności i praw (art. 31 ust. 3). Mimo niemal powszechnej akceptacji tej tezy, nie wytrzymuje ona krytyki opartej na pierwszeństwie, które w polskim porządku prawnym mają zobowiązania traktowe dotyczące praw człowieka, wobec regulacji ustawowych. Ze względu na wzorzec międzynarodowy, który nie przewiduje stosowania klasycznej klauzuli limitacyjnej do prawa do życia, mimo uznania - na poziomie standardu konstytucyjnego - stosowalności klauzuli z art. 31 ust. 3 do art. 38 i ochrony życia w ogóle, stosowalność tej klauzuli będzie uniemożliwiona przy każdej próbie formułowania standardu ustawowego. Autor zwraca uwagę na wadliwość wnioskowania prowadzącego od uznania dopuszczalności pewnych ograniczeń ochrony jakiejś wartości (np. życia) na podstawie wyjątków ex definitione obecnych w standardzie międzynarodowym, do tezy o stosowalności klauzuli limitacyjnej przy kształtowaniu standardu ustawowego w polskim systemie prawnym. (shrink)

Computational complexity is a discipline of computer science and mathematics which classifies computational problems depending on their inherent difficulty, i.e. categorizes algorithms according to their performance, and relates these classes to each other. P problems are a class of computational problems that can be solved in polynomial time using a deterministic Turing machine while solutions to NP problems can be verified in polynomial time, but we still do not know whether they can be solved in polynomial time as well. A (...) solution for the so-called NP-complete problems will also be a solution for any other such problems. Its artificial-intelligence analogue is the class of AI-complete problems, for which a complete mathematical formalization still does not exist. In this chapter we will focus on analysing computational classes to better understand possible formalizations of AI-complete problems, and to see whether a universal algorithm, such as a Turing test, could exist for all AI-complete problems. In order to better observe how modern computer science tries to deal with computational complexity issues, we present several different deep-learning strategies involving optimization methods to see that the inability to exactly solve a problem from a higher order computational class does not mean there is not a satisfactory solution using state-of-the-art machine-learning techniques. Such methods are compared to philosophical issues and psychological research regarding human abilities of solving analogous NP-complete problems, to fortify the claim that we do not need to have an exact and correct way of solving AI-complete problems to nevertheless possibly achieve the notion of strong AI. (shrink)

Prior’s problem consists in the impossibility of replacing clausal complements of most attitude verbs by ‘ordinary’ NPs; only ‘special quantifiers’ that is, quantifiers like 'something' permit a replacement, preserving grammaticality or the same reading of the verb: (1) a. John claims that he won. b. ??? John claims a proposition / some thing. c. John claims something. In my 2013 book Abstract Objects and the Semantics of Natural Language, I have shown how this generalizes to nonreferential complements of various other (...) intensional predicates and argued for a Nominalization Theory of special quantifiers. In this paper, I will review and extend the range of linguistic generalizations that motivate the Nominalization Theory and show that they pose serious problems for higher-order and substitutional analyses of special quantifiers. (shrink)

This paper reports an experiment that investigates interpretive distinctions between two different expressions of generalization in Spanish. In particular, our aim was to find out when the distinction between generic statements (GS) such as Tigers have stripes and universally quantified statements (UQS) such as All tigers have stripes was acquired in Spanish-speaking children of two different age groups (4/5-year-olds and 8/9-year-olds), and then compare these results with those of adults. The starting point of this research was the semantic distinction between (...) GS and UQS in that the former admit exceptions, unlike the latter. On the other hand, several authors have observed a Generic overgeneralization effect (GOG) consisting in allowing for UQS to be felicitous in the face of exceptions, thus proposing that this “error” stems from GS being defaults (simpler, more easily learned and processed). In the current paper we aimed to test the “Generics as Default” (GaD) hypothesis by comparing GS and UQS in three different age ranges. Our data show that, overall, the accuracy of GS is greater than the accuracy of UQS. Moreover, we also confirm a hypothesized interaction between age and NP type (GS vs UQS). Further, we present several data points that are not predicted by the GaD, including an observed decline in the accuracy of GS in the older group of children as well as in adults, and that children fail at rejecting statements that are not considered to be true generalizations. (shrink)

Podstawowym założeniem artykułu jest uznanie, że złożoność wyzwań związanych ze starzeniem się populacji wymusza rozwój powiązań kooperacyjnych między podmiotami polityki publicznej reprezentującymi różne sektory. Innymi słowy: niezbędna jest bardziej intensywna i lepiej skoordynowana współpraca między organizacjami sektora publicznego, komercyjnego, pozarządowego, nieformalnego oraz sektora obejmującego podmioty gospodarki społecznej (np. spółdzielnie). Zasadnicze znaczenie ma w tym kontekście wdrażanie założeń teorii współzarządzania (governance), koprodukcji oraz mieszanej gospodarki dobrobytu (inaczej: wielosektorowej polityki społecznej). W konsekwencji artykuł wskazuje na wybrane wątki dyskursu dotyczącego relacji procesu starzenia (...) się ludności z przedsiębiorczością społeczną i innowacjami społecznymi. Tekst przytacza także przykłady dobrych praktyk i inicjatyw z obszaru gospodarki społecznej. Podsumowanie zawiera rekomendacje dla podmiotów polityki publicznej oraz proponowane kierunki dalszych badań. (shrink)

FDE is a logic that captures relevant entailment between implication-free formulae and admits of an intuitive informational interpretation as a 4-valued logic in which “a computer should think”. However, the logic is co-NP complete, and so an idealized model of how an agent can think. We address this issue by shifting to signed formulae where the signs express imprecise values associated with two distinct bipartitions of the set of standard 4 values. Thus, we present a proof system which consists of (...) linear operational rules and only two branching structural rules, the latter expressing a generalized rule of bivalence. This system naturally leads to defining an infinite hierarchy of tractable depth-bounded approximations to FDE. Namely, approximations in which the number of nested applications of the two branching rules is bounded. (shrink)