The author explains that his background was in experimental psychology but that he wanted to study the whole person and not fragmented psychological processes. He also desired a non-reductionistic method for studying humans. Fortunately he came across the work of Edmund Husserl and discovered in the latter’s thought a way of researching humans that met the criteria he was seeking. Eventually he developed a phenomenological method for researching humans in a psychological way based upon the work of Husserl and Merleau-Ponty. (...) This article briefly describes the method. (shrink)

Cirquent calculus is a novel proof theory permitting component-sharing between logical expressions. Using it, the predecessor article ‘Elementary-base cirquent calculus I: Parallel and choice connectives’ built the sound and complete axiomatization $\textbf{CL16}$ of a propositional fragment of computability logic. The atoms of the language of $\textbf{CL16}$ represent elementary, i.e. moveless, games and the logical vocabulary consists of negation, parallel connectives and choice connectives. The present paper constructs the first-order version $\textbf{CL17}$ of $\textbf{CL16}$, also enjoying soundness and completeness. The language of (...) $\textbf{CL17}$ augments that of $\textbf{CL16}$ by including choice quantifiers. Unlike classical predicate calculus, $\textbf{CL17}$ turns out to be decidable. (shrink)

This book considers the semantic and syntactic nature of indexicals - linguistic expressions, as in I, you, this, that, yesterday, tomorrow , whose reference shifts from utterance to utterance.There is a long-standing controversy as to whether the semantic reference point is already present as syntactic material or whether it is introduced post-syntactically by semantic rules of interpretation. Alessandra Giorgi resolves this controversy through an empirically grounded exploration of temporal indexicality, arguing that the speaker's temporal location is specified in the (...) syntactic structure. She supports her analysis with theoretical and empirical arguments based on data from English, Italian, Chinese, and Romanian. Professor Giorgi addresses some difficult and longstanding issues in the analysis of temporal phenomena - including the Italian imperfect indicative, the properties of the so-called future-in-the-past, and the properties of Free Indirect Discourse - and shows that her framework can account elegantly for all of them. Carefully argued, succinct, and clearly written her book will appeal widely to semanticists in linguistics and philosophy from graduate level upwards and to linguists interested in the syntax-semantics interface. (shrink)

The paper introduces a semantics for the language of classical first order logic supplemented with the additional operators and . This semantics understands formulas as tasks. An agent , working as a slave for its master , can carry out the task αβ if it can carry out any one of the two tasks α, β, depending on which of them was requested by the master; similarly, it can carry out xα if it can carry out α for any particular (...) value for x selected by the master; an agent can carry out α→β if it can carry out β as long as it has, as a slave , an agent who carries out α; finally, carrying out P, where P is an atomic formula, simply means making P true; in particular, is a task that no agent can carry out. When restricted to the language of classical logic, the meaning of formulas is isomorphic to their classical meaning, which makes our semantics a conservative extension of classical semantics.This semantics can claim to be a formalization of the resource philosophy associated with linear logic, if resources are understood as agents carrying out tasks. The classical operators of our language correspond to the multiplicative operators of linear logic, while and correspond to the additive conjunction and universal quantifier, respectively.Our formalism may also have a potential to be used in AI as an alternative logic of planning and action. Its main appeal is that it is immune to the frame problem and the knowledge preconditions problem.The paper axiomatically defines a logic L in the above language and proves its soundness and completeness with respect to the task semantics in the following intuitive sense: L α iff α can be carried out by an agent who has nothing but its intelligence for carrying out tasks. This logic is shown to be semidecidable in the full language and decidable when the classical quantifier is forbidden in it. (shrink)

Computability logic (CL) is a recently launched program for redeveloping logic as a formal theory of computability, as opposed to the formal theory of truth that logic has more traditionally been. Formulas in it represent computational problems, "truth" means existence of an algorithmic solution, and proofs encode such solutions. Within the line of research devoted to finding axiomatizations for ever more expressive fragments of CL, the present paper introduces a new deductive system CL12 and proves its soundness and completeness with (...) respect to the semantics of CL. Conservatively extending classical predicate calculus and offering considerable additional expressive and deductive power, CL12 presents a reasonable, computationally meaningful, constructive alternative to classical logic as a basis for applied theories. To obtain a model example of such theories, this paper rebuilds the traditional, classical-logic-based Peano arithmetic into a computability-logic-based counterpart. Among the purposes of the present contribution is to provide a starting point for what, as the author wishes to hope, might become a new line of research with a potential of interesting findings—an exploration of the presumably quite unusual metatheory of CL-based arithmetic and other CL-based applied systems. (shrink)

Within the program of finding axiomatizations for various parts of computability logic, it was proven earlier that the logic of interactive Turing reduction is exactly the implicative fragment of Heyting’s intuitionistic calculus. That sort of reduction permits unlimited reusage of the computational resource represented by the antecedent. An at least equally basic and natural sort of algorithmic reduction, however, is the one that does not allow such reusage. The present article shows that turning the logic of the first sort of (...) reduction into the logic of the second sort of reduction takes nothing more than just deleting the contraction rule from its Gentzen-style axiomatization. The first sort of interactive reduction is also shown to come in three natural versions. While those three versions are very different from each other, their logical behaviors turn out to be indistinguishable, with that common behavior being precisely captured by implicative intuitionistic logic. Among the other contributions of the present article is an informal introduction of a series of new — finite and bounded — versions of recurrence operations and the associated reduction operations. (shrink)

I present a semantics for the language of first-order additive-multiplicative linear logic, i.e. the language of classical first-order logic with two sorts of disjunction and conjunction. The semantics allows us to capture intuitions often associated with linear logic or constructivism such as sentences = games, SENTENCES = resources or sentences = problems, where “truth” means existence of an effective winning strategy.The paper introduces a decidable first-order logic ET in the above language and gives a proof of its soundness and completeness (...) with respect to this semantics. Allowing noneffective strategies in the latter is shown to lead to classical logic.The semantics presented here is very similar to Blass's game semantics. Although there is no straightforward reduction between the two corresponding notions of validity, my completeness proof can likely be adapted to the logic induced by Blass's semantics to show its decidability, which was the main problem left open in Blass's paper.The reader needs to be familiar with classical logic and arithmetic. (shrink)

It is often asserted that a liberal theory of political obligation is unattainable. This is, largely, because liberalism revolves around consent and hence, is supposed to be intrinsically inimical to the existence of state authority. However, there is at least one liberal proposal – the argument of fair play, that makes a plausible case for justifying the establishment of a coercive entity. The most popular contemporary version of it, which is offered by George Klosko, turns on the fact that non-excludable (...) goods cannot be exchanged based on consent. Instead, there must be enforceable, independent, objective standards of fairness that should govern the distribution of the effects of such goods. In this article, I argue that if Klosko’s account is correct, then not only the existence of non-excludable goods but also, the production and exchange of existentially significant excludable goods warrant an establishment of coercive authority. I argue that in this way, we can take an important step towards establishing a full-blown liberal theory of political obligation. (shrink)

This paper constructs a cirquent calculus system and proves its soundness and completeness with respect to the semantics of computability logic. The logical vocabulary of the system consists of negation ${\neg}$ , parallel conjunction ${\wedge}$ , parallel disjunction ${\vee}$ , branching recurrence ⫰, and branching corecurrence ⫯. The article is published in two parts, with (the present) Part I containing preliminaries and a soundness proof, and (the forthcoming) Part II containing a completeness proof.

This work is an attempt to lay foundations for a theory of interactive computation and bring logic and theory of computing closer together. It semantically introduces a logic of computability and sets a program for studying various aspects of that logic. The intuitive notion of computational problems is formalized as a certain new, procedural-rule-free sort of games between the machine and the environment, and computability is understood as existence of an interactive Turing machine that wins the game against any possible (...) environment. The formalism used as a specification language for computational problems, called the universal language, is a non-disjoint union of the formalisms of classical, intuitionistic and linear logics, with logical operators interpreted as certain—most basic and natural—operations on problems. Validity of a formula is understood as being “always computable”, and the set of all valid formulas is called the universal logic. The name “universal” is related to the potential of this logic to integrate, on the basis of one semantics, classical, intuitionistic and linear logics, with their seemingly unrelated or even antagonistic philosophies. In particular, the classical notion of truth turns out to be nothing but computability restricted to the formulas of the classical fragment of the universal language, which makes classical logic a natural syntactic fragment of the universal logic. The same appears to be the case for intuitionistic and linear logics . Unlike classical logic, these two do not have a good concept of truth, and the notion of computability restricted to the corresponding two fragments of the universal language, based on the intuitions that it formalizes, can well qualify as “intuitionistic truth” and “linear-logic truth”. The paper also provides illustrations of potential applications of the universal logic in knowledgebase, resourcebase and planning systems, as well as constructive applied theories. The author has tried to make this article easy to read. It is fully self-contained and can be understood without any specialized knowledge of any particular subfield of logic or computer science. (shrink)

L’autore presenta lo sviluppo del proprio metodo a partire dal background psicologico sperimentale da cui proviene e dal quale ha preso le distanze, a partire dal desiderio di studiare l’essere umano con un approccio globale, un metodo scientifico non frammentario. L’incontro con la filosofia di Edmund Husserl ha connotato questo suo percorso, in essa egli ha scoperto un approccio che rendesse possibile la ricerca sui fenomeni umani proprio con i criteri che andava inseguendo. Il metodo di ricerca che ha quindi (...) elaborato si basa sul lavoro di Husserl e di Merleau-Ponty. L’articolo descrive brevemente questo metodo.The author explains that his background was in experimental psychology but that he wanted to study the whole person and not fragmented psychological processes. He also desired a non-reductionistic method for studying humans. Fortunately he came across the work of Edmund Husserl and discovered in the latter’s thought a way of researching humans that met the criteria he was seeking. Eventually he developed a phenomenological method for researching humans in a psychological way based upon the work of Husserl and Merleau-Ponty. This article briefly describes the method. (shrink)

The paper demonstrates that a detailed analysis of Hegel’s criticism of rationalist metaphysics in the “Vorbegriff” (Preliminary Conception) chapter of the Encyclopedia Logic can shed light on the following critical features of Hegel’s metaphysics: (1) advancing semantic holism as an alternative to semantic atomism; (2) renouncing the projection of a substance-attribute formal structure onto actuality; (3) dismissing sense perception as the source of conceptual content; and (4) rejecting dualist ontology.

This book argues that the Doctrine of the Concept is the centerpiece of Hegel’s philosophical system and, through a close analysis of this final part of the Science of Logic, presents a detailed account of the key features of Hegel’s ontology.

The phenomenon of "social alchemy", containing the idea of the possibility of creating a new man and a new world and passing through all radical thought, especially of the New and Modern times, had and has a habit of pouring out into violence, in the broadest sense of the word, — from the guillotine and concentration camps to modern "information colonization of consciousness". Having received technological support, when digital technologies and new communication systems cover almost the entire world community, leaving (...) no one outside of their comprehensive influence, the phenomenon of "social alchemy" has acquired a qualitatively different, special and global significance. At the same time, the goals, means and actors have changed, only its radical component has remained unchanged, striving to transform society and build such social, political and economic structures and relations, that would correspond to certain ideas of some elites (economic, political, intellectual) about what should the global world be like in order to ensure their interests to the greatest extent. (shrink)

We show that there exist downwards properly $\Sigma _{2}^{0}$ (in fact noncuppable) e-degrees that are not high. We also show that every high e-degree bounds a noncuppable e-degree.

This paper presents a soundness and completeness proof for propositional intuitionistic calculus with respect to the semantics of computability logic. The latter interprets formulas as interactive computational problems, formalized as games between a machine and its environment. Intuitionistic implication is understood as algorithmic reduction in the weakest possible — and hence most natural — sense, disjunction and conjunction as deterministic-choice combinations of problems , and “absurd” as a computational problem of universal strength.

This paper constructs a cirquent calculus system and proves its soundness and completeness with respect to the semantics of computability logic. The logical vocabulary of the system consists of negation \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\neg}}$$\end{document}, parallel conjunction \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\wedge}}$$\end{document}, parallel disjunction \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\vee}}$$\end{document}, branching recurrence ⫰, and branching corecurrence ⫯. The article is published in two parts, with (the previous) (...) Part I containing preliminaries and a soundness proof, and (the present) Part II containing a completeness proof. (shrink)

Soviet Marxism is often characterized by the term ontologism. The latter could be defined as a totalizing assertion about material being as inherently dialectical, often coupled with an understanding of thought as mere reflection. This fundamental assertion is said to remain unchallenged among dogmatic party philosophers and critical Marxists alike. Far from an innocent misconception, Soviet ontologism is associated with some of the harshest historical events like the Lysenko affair, where the imposition of the dialectical optic onto the natural sciences (...) resulted in an ideological blockade of research. Various sources of this peculiarity have been identified in Soviet Marxism, from the endorsement of dialectics of nature to the rejection of Cartesian metaphysics. However, a political account of Soviet ontologism is yet to be written. This article will address the question of ontologism as it has been theorized in relation to the philosophy of Evald Ilyenkov. Tracing the history of Russian ontologism from the nineteenth century, we will recover its nationalist dimension. Then, drawing on the philosophical controversies between Lenin and Bogdanov, which in turn will be linked to Ilyenkov’s intervention, we will examine the various strands of ontological thinking in Soviet Marxism and identify Ilyenkov’s position. Finally, we will ask what insights can the ontological thinking of Soviet Marxism provide in the context of contemporary philosophical turns towards ontology. (shrink)

Cirquent calculus is a proof system with inherent ability to account for sharing subcomponents in logical expressions. Within its framework, this article constructs an axiomatization $$\text{ CL18 }$$ CL18 of the basic propositional fragment of computability logic—the game-semantically conceived logic of computational resources and tasks. The nonlogical atoms of this fragment represent arbitrary so called static games, and the connectives of its logical vocabulary are negation and the parallel and choice versions of conjunction and disjunction. The main technical result of (...) the article is a proof of the soundness and completeness of $$\text{ CL18 }$$ CL18 with respect to the semantics of computability logic. (shrink)

This article aims to provide a brief overview of mental causation problem and its current proposed solutions. Indeed, mental causation turns out as one of the most difficult philosophical conundrums in contemporary philosophy of mind. In the first two sections, we offer an outline of the problem and the philosophical debate about it, and show that mental causation problem is pivotal within the contemporary philosophy of mind. In the third section, we focus on the most popular models of mental causation, (...) namely Kim's and Davidson's accounts, also discussing the objections raised against them. In the final section, we take into consideration some recent proposals poised to solve the mental causation problem, including powerism. Given the logical and metaphysical plausibility of almost all these different options, our conclusion is that mental causation is still an open problem and it is far from being resolved. (shrink)

Convergences between phenomenological psychology (PP) and behaviorism include opposition to dualism between the physical world and mental representations, and between a real visible man and an "inner" man with conscious states of which he alone is aware. Additionally, both views favor cautious use of theories, especially those which utilize hypothetico-deductive methodology, and a careful, descriptive, rather than inferential approach to behavior. Behaviorism and PP also share opposition to physiological reductionism. The 2 viewpoints diverge regarding their understanding of science. PP is (...) more sensitive to the difference between natural and human phenomena and contends that the latter cannot be adequately dealt with by means of the scientific approach applicable with the former. Rather, a broader and more naively descriptive approach must be adopted. A further difference is that PP accepts intentionality in man's viewpoint of the world while behaviorism accounts for man strictly in terms of external relations. Finally, the phenomenologist is more likely to eschew the language of control in describing man and, instead, emphasize a careful description of the meanings man imposes on his world. (shrink)

This paper means to demonstrate the theoretical-and- methodological potential of a particular pattern of thought about culture. Employing an end-means and absolute value plus concept of reality approach, the continuous model of culture aims to embrace from one holistic standpoint various concepts and debates of the modern human, social, and political sciences. The paper revisits the debates of fact versus value, nature versus culture, culture versus structure, agency versus structure, and economics versus politics and offers the concepts of the rule (...) of law, state capitalism, a dialectical model of progress, and interpretative qualitative research, as well as of cultural diffusion, autonomy, alienation, and individuality. This model distinguishes between the ideal-symbolical and the instrumental functions of culture, sees culture as being sewn from universal binaries, and provides a certain understanding of the cognitive function of a value judgment, with positivism so far vague about the topic. It, too, suggests an extra method for investigating culture : the comparative literature study of culture enables social science to view literature as its potential in-depth interviewee— a case for arguing for a certain conception of interdisciplinarity as well. In addition, it predicts that cultural particularism or individuality remains an essential factor of human existence. Analyzing the issue of Eurocentrism in social science, the model finds modernity ’s concept of reality to be involved in ” methodological ” intellectualistic reductionism, characterizing it since the empiricism/ rationalism origination. Systematically confusing the universal oppositions in a Eurocentric manner, intellectualism becomes a contributing factor in unfolding post- modernity. (shrink)

Predicate modal formulas with non-modalized quantifiers (call them Q-formulas) are considered as schemata of arithmetical formulas, where is interpreted as the provability predicate of some fixed correct extension T of arithmetic. A method of constructing 1) non-provable in T and 2) false arithmetical examples for Q-formulas by Kripke-like countermodels of certain type is given. Assuming the means of T to be strong enough to solve the (undecidable) problem of derivability in QGL, the Q-fragment of the predicate version of the logic (...) GL, we prove the recursive enumerability of the sets of Q-formulas all arithmetical examples of which are: 1) T-provable, 2) true. In. particular, the first one is shown to be exactly QGL and the second one to be exactly the Q-fragment of the predicate version of Solovay's logic S. (shrink)

The present paper constructs three new systems of clarithmetic : CLA8, CLA9 and CLA10. System CLA8 is shown to be sound and extensionally complete with respect to PA-provably recursive time computability. This is in the sense that an arithmetical problem A has a τ-time solution for some PA-provably recursive function τ iff A is represented by some theorem of CLA8. System CLA9 is shown to be sound and intensionally complete with respect to constructively PA-provable computability. This is in the sense (...) that a sentence X is a theorem of CLA9 iff, for some particular machine M, PA proves that M computes X. And system CLA10 is shown to be sound and intensionally complete with respect to not-necessarily-constructively PA-provable computability. This means that a sentence X is a theorem of CLA10 iff PA proves that X is computable, even if PA does not “know” of any particular machine M that computes X. (shrink)