This article presents a sequent calculus for a negative free logic with identity, called N . The main theorem (in part 1) is the admissibility of the Cut-rule. The second part of this essay is devoted to proofs of soundness, compactness and completeness of N relative to a standard semantics for negative free logic.

Betrachtet man den Gebrauch der Worte ‘Moral’ und ‘Vernunft’ etwas genauer, so stellt man fest, dass nicht klar ist, was sie bezeichnen bzw. wie Moral und Vernunft zusammenhängen. In dem Buch ‘Rationalität in der Angewandten Ethik’, in dem sich verschiedene Autoren die Aufgabe gestellt haben, diese Umstände in das Licht der Betrachtung zu rücken, finden wir Fragen darüber, wie “Moral”, “Angewandte Ethik” und “Vernunft” (auch in der Anwendung) zu verstehen und zu vereinen sind.

We introduce a new understanding of deontic modals that we callobligations as weakest permissions. We argue for its philosophical plausibility, study its expressive power in neighborhood models, provide a complete Hilbert-style axiom system for it and show that it can be extended and applied to practical norms in decision and game theory.

This paper deals with the question of the logicality of modal logics from a proof-theoretic perspective. It is argued that if Dos̆en’s analysis of logical constants as punctuation marks is embraced, it is possible to show that all the modalities in the cube of normal modal logics are indeed logical constants. It will be proved that the display calculus for each displayable modality admits a purely structural presentation based on double-line rules which, following Dos̆en’s analysis, allows us to claim that (...) the corresponding modal operators are logical constants. (shrink)

Rudolf Carnap’s mature work on the logical reconstruction of scientific theories consists of two components. The first is the elimination of the theoretical vocabulary of a theory in terms of its Ramsification. The second is the reintroduction of the theoretical terms through explicit definitions in a language containing an epsilon operator. This paper investigates Carnap’s epsilon-reconstruction of theories in the context of pure mathematics. The main objective here is twofold: first, to specify the epsilon logic underlying his suggested definition of (...) theoretical terms and a suitable choice semantics for it. Second, to analyze whether Carnap’s approach is compatible with a structuralist conception of mathematics. (shrink)

We investigate incomplete symbols, i.e. definite descriptions with scope-operators. Russell famously introduced definite descriptions by contextual definitions; in this article definite descriptions are introduced by rules in a specific calculus that is very well suited for proof-theoretic investigations. That is to say, the phrase ‘incomplete symbols’ is formally interpreted as to the existence of an elimination procedure. The last section offers semantical tools for interpreting the phrase ‘no meaning in isolation’ in a formal way.

In this paper we apply proof theoretic methods used for classical systems in order to obtain upper bounds for systems in partial logic. We focus on a truth predicate interpreted in a Kripke style way via strong Kleene; whereas the aim is to connect harmoniously the partial version of Kripke–Feferman with its intended semantics. The method we apply is based on infinitary proof systems containing an ω\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\omega $$\end{document}-rule.

We study the logic of so-called lexicographic or priority merge for multi-agent plausibility models. We start with a systematic comparison between the logical behavior of priority merge and the more standard notion of pooling through intersection, used to define, for instance, distributed knowledge. We then provide a sound and complete axiomatization of the logic of priority merge, as well as a proof theory in labeled sequents that admits cut. We finally study Moorean phenomena and define a dynamic resolution operator for (...) priority merge for which we also provide a complete set of reduction axioms. (shrink)

In this paper we apply proof theoretic methods used for classical systems in order to obtain upper bounds for systems in partial logic. We focus on a truth predicate interpreted in a Kripke style way via strong Kleene; whereas the aim is to connect harmoniously the partial version of Kripke–Feferman with its intended semantics. The method we apply is based on infinitary proof systems containing an ω-rule.

In this paper we use proof-theoretic methods, specifically sequent calculi, admissibility of cut within them and the resultant subformula property, to examine a range of philosophically-motivated deontic logics. We show that for all of those logics it is a (meta)theorem that the Special Hume Thesis holds, namely that no purely normative conclusion follows non-trivially from purely descriptive premises (nor vice versa). In addition to its interest on its own, this also illustrates one way in which proof theory sheds light on (...) philosophically substantial questions. (shrink)

Definite descriptions are in the focus of philosophical discussion at least since Russell's famous paper "On Denoting". We present in this paper a logic with descriptions in Russell's spirit. The formulation, however, is closely related to Schütte's development of predicate logic, i.e. the formulation of the calculus uses positive- and negative-parts. With respect to this slightly more sophisticated formulation it is possible to formalize Russell's convention that is originally stated in the metalanguage of his theory of descriptions within our calculus. (...) In this paper we prove an elimination theorem for this calculus. (shrink)

This article investigates the proof theory of the Quantified Argument Calculus as developed and systematically studied by Hanoch Ben-Yami [3, 4]. Ben-Yami makes use of natural deduction, we, however, have chosen a sequent calculus presentation, which allows for the proofs of a multitude of significant meta-theoretic results with minor modifications to the Gentzen’s original framework, i.e., LK. As will be made clear in course of the article LK-Quarc will enjoy cut elimination and its corollaries.

Free logics is a family of first-order logics which came about as a result of examining the existence assumptions of classical logic. What those assumptions are varies, but the central ones are that the domain of interpretation is not empty, every name denotes exactly one object in the domain and the quantifiers have existential import. Free logics usually reject the claim that names need to denote in, and of the systems considered in this paper, the positive free logic concedes that (...) some atomic formulas containing non-denoting names are true, while negative free logic rejects even the latter claim. Inclusive logics, which reject, are likewise considered. These logics have complex and varied axiomatizations and semantics, and the goal of this paper is to present an orderly examination of the various systems and their mutual relations. This is done by first offering a formalization, using sequent calculi which possess all the desired structural properties of a good proof system, including admissibility of contraction and cut, while streamlining free logics in a way no other approach has. We then present a simple and unified system of abstract semantics, which allows for a straightforward demonstration of the meta-theoretical properties, and offers insights into the relationship between different logics. The final part of this paper is dedicated to extending the system with modalities by using a labeled sequent calculus, and here we are again able to map out the different approaches and their mutual relations using the same framework. (shrink)

The Quantified argument calculus (Quarc) has received a lot of attention recently as an interesting system of quantified logic which eschews the use of variables and unrestricted quantification, but nonetheless achieves results similar to the Predicate calculus (PC) by employing quantifiers applied directly to predicates instead. Despite this noted similarity, the issue of the relationship between Quarc and PC has so far not been definitively resolved. We address this question in the present paper, and then expand upon that result. Utilizing (...) recent developments in structural proof theory, we develop a G3-style sequent calculus for Quarc and briefly demonstrate its structural properties. We put these properties to use immediately to construct direct proofs of the meta-theoretical properties of the system. We then incorporate an abstract (and, as we shall see, logical) predicate into the system in a way that preserves all the structural properties. This allows us to identify a system of Quarc which is deductively equivalent to PC, and also yields a constructive method of demonstrating the Craig interpolation theorem (which speaks in favor of the aforementioned predicate being logical). We further generalize this extension to develop a bivalent system of Quarc with defining clauses that still maintains all the desirable properties of a good proof system. (shrink)

We study two logics of knowledge and belief stemming from the work of Stalnaker, omitting positive introspection for knowledge. The two systems are equivalent with positive introspection, but not without. We show that while the logic of beliefs remains unaffected by omitting introspection for knowledge in one system, it brings significant changes to the other. The resulting logic of belief is non-normal, and its complete axiomatization uses an infinite hierarchy of coherence constraints. We conclude by returning to the philosophical interpretation (...) underlying both models of belief, showing that neither is strong enough to support a probabilistic interpretation, nor an interpretation in terms of certainty or the “mental component” of knowledge. (shrink)

We study two logics of knowledge and belief stemming from the work of Stalnaker, omitting positive introspection for knowledge. The two systems are equivalent with positive introspection, but not without. We show that while the logic of beliefs remains unaffected by omitting introspection for knowledge in one system, it brings significant changes to the other. The resulting logic of belief is non-normal, and its complete axiomatization uses an infinite hierarchy of coherence constraints. We conclude by returning to the philosophical interpretation (...) underlying both models of belief, showing that neither is strong enough to support a probabilistic interpretation, nor an interpretation in terms of certainty or the “mental component” of knowledge. (shrink)

This paper extends the investigations into logical properties of the quantified argument calculus (Quarc) by suggesting a series of proper subsystems which, although retaining the entire vocabulary of Quarc, restrict quantification in such a way as to make the result decidable. The proof of decidability is via a procedure that prunes the infinite branches of a derivation tree in what is a syntactic counterpart of semantic filtration. We demonstrate an application of one of these systems by showing that Aristotle’s assertoric (...) syllogistic is embeddable within, thus also providing another method of showing its decidability. (shrink)

Free logics are a family of first-order logics which came about as a result of examining the existence assumptions of classical logic (Hintikka _The Journal of Philosophy_, _56_, 125–137 1959 ; Lambert _Notre Dame Journal of Formal Logic_, _8_, 133–144 1967, 1997, 2001 ). What those assumptions are varies, but the central ones are that (i) the domain of interpretation is not empty, (ii) every name denotes exactly one object in the domain and (iii) the quantifiers have existential import. Free (...) logics reject the claim that names need to denote in (ii). _Positive_ free logic concedes that some atomic formulas containing non-denoting names (including self-identity) are true, _negative_ free logic treats them as uniformly false, and _neutral_ free logic as taking a third value. There has been a renewed interest in analyzing proof theory of free logic in recent years, based on intuitionistic logic in Maffezioli and Orlandelli (_Bulletin of the Section of Logic_, _48_(2), 137–158 2019 ) as well as classical logic in Pavlović and Gratzl (_Journal of Philosophical Logic_, _50_, 117–148 2021 ), there for the positive and negative variants. While the latter streamlines the presentation of free logics and offers a more unified approach to the variants under consideration, it does not cover neutral free logic, since there is some lack of both clear formal intuitions on the semantic status of formulas with empty names, as well as a satisfying account of the conditional in this context. We discuss extending the results to this third major variant of free logics. We present a series of G3 sequent calculi adapted from Fjellstad (_Studia Logica_, _105_(1), 93–119 2017, _Journal of Applied Non-Classical Logics_, _30_(3), 272–289 2020 ), which possess all the desired structural properties of a good proof system, including admissibility of contraction and all versions of the cut rule. At the same time, we maintain the unified approach to free logics and moreover argue that greater clarity of intuitions is achieved once neutral free logic is conceptualized as consisting of two sub-varieties. (shrink)

Deleuze’ün Spinozacı yaşam tahayyülünde ‘ne yapmalıyız?’ sorusuna normatif, ahlaki ya da siyasi bir yanıt bulamıyoruz ama varoluşu düşünmenin içkin bir olanağını keşfediyoruz. Düşünmeye 'dışarıdan' yani dünyadan başlamak insani (kurgusal) bir dünyaya değil, içinde yaşadığımız gerçek dünyaya inanmak demektir. İçkinliğin politik anlamı düşünceyi dünyaya getirmektir.

Исследование посвящено философскому осознанию природы духовности человека. Автор рассматривает духовность внутреннего мира человека как единство высших чувств души и нравственного сознания. Для специалистов в области философии, методологии науки.

How do we refer to people in everyday conversation? No matter the language or culture, we must choose from a range of options: full name ('Robert Smith'), reduced name ('Bob'), description ('tall guy'), kin term ('my son') etc. Our choices reflect how we know that person in context, and allow us to take a particular perspective on them. This book brings together a team of leading linguists, sociologists and anthropologists to show that there is more to person reference than meets (...) the eye. Drawing on video-recorded, everyday interactions in nine languages, it examines the fascinating ways in which we exploit person reference for social and cultural purposes, and reveals the underlying principles of person reference across cultures from the Americas to Asia to the South Pacific. Combining rich ethnographic detail with cross-linguistic generalizations, it will be welcomed by researchers and graduate students interested in the relationship between language and culture. (shrink)

The first thorough study in English of the multi-faceted system of Mou Zongsan, this book examines key influences on the New Confucian thinker and introduces his Kantian- and Mahāyāna Fo-inflected moral metaphysical reading of the Lu-Wang Learning of the Mind.

In this age of DNA computers and artificial intelligence, information is becoming disembodied even as the "bodies" that once carried it vanish into virtuality. While some marvel at these changes, envisioning consciousness downloaded into a computer or humans "beamed" _Star Trek_-style, others view them with horror, seeing monsters brooding in the machines. In _How We Became Posthuman,_ N. Katherine Hayles separates hype from fact, investigating the fate of embodiment in an information age. Hayles relates three interwoven stories: how information lost (...) its body, that is, how it came to be conceptualized as an entity separate from the material forms that carry it; the cultural and technological construction of the cyborg; and the dismantling of the liberal humanist "subject" in cybernetic discourse, along with the emergence of the "posthuman." Ranging widely across the history of technology, cultural studies, and literary criticism, Hayles shows what had to be erased, forgotten, and elided to conceive of information as a disembodied entity. Thus she moves from the post-World War II Macy Conferences on cybernetics to the 1952 novel _Limbo_ by cybernetics aficionado Bernard Wolfe; from the concept of self-making to Philip K. Dick's literary explorations of hallucination and reality; and from artificial life to postmodern novels exploring the implications of seeing humans as cybernetic systems. Although becoming posthuman can be nightmarish, Hayles shows how it can also be liberating. From the birth of cybernetics to artificial life, _How We Became Posthuman_ provides an indispensable account of how we arrived in our virtual age, and of where we might go from here. (shrink)