Logical Expressions

It is shown that Georius Benignus [Juraj Dragišić] at the end of the 15th century almost fully disposed with the theory of the fourth syllogistic figure. Prantl's view on Benignus' logic is critically examined. Besides, Benignus' doctrines on the supposition of terms and logical consequences are examined with respect to his two versions of logic (1488/1489 and 1519) and to the main influences (e.g., Strodus, Paulus Venetus, Ferebrich, Paulus Pergolensis). A reduction of the rules of consequences of Benignus' logic 1488/1489 (...) to the rules of logic 1519 is reconstructed. Benignus rejects the reasoning ex impossible quodlibet and e quolibet necessarium for what he defines as material consequences. (shrink)

It is shown in what sense essential characteristics of formalism, which is normative for exact knowledge, can be found already in Aristotle. It is described how exactness and formalism are pre-conditioned by sensible intuition. The machine character (Turing machine) of a formalism is considered. The general concept of provability leads to an expanding and dynamic understanding of a formalism, with the final source of logical patterns in the "forms of life" (Wittgenstein).

According to an influential view, when it comes to representing reality, some words are better suited for the job than others. This is elitism. There is reason to believe that the set of the best, or elite, words should not be redundant or arbitrary. However, we are often forced to choose between these two theoretical vices, especially in cases involving theories that seem to be mere notational variants. This is the riddle of redundancy: both redundancy and arbitrariness are vicious, but (...) there are cases in which one must be picked. Logical realists admit that there are some logical constants among the elite words. This leads to awkward questions, such as which among conjunction and disjunction is elite. In this paper, I show how the riddle of redundancy arises for logical realists, and offer a solution. This approach requires us to change how we represent negation. Instead of using some particular symbol, we represent negation by flipping formulae over the horizontal axis. (shrink)

This paper is a short introduction to Carnap’s writings on semantics with an emphasis on the transition from the syntactic period to the semantic one. I claim that one of Carnap’s main aims was to investigate the possibility of the symmetry between the syntactic and the semantic methods of approaching philosophical problems, both in logic and in the philosophy of science. This ideal of methodological symmetry could be described as an attempt to obtain categorical logical systems, i.e., systems that allow (...) only the intended semantical interpretation. (shrink)

I try to identify elements of our mental capacities that separate us from animals. I focus on our command of logical concepts, demonstrable already in children in the second or third year of their life, which to date no animal has been shown to master. I draw various conclusions about the behavioural, intellectual, emotional, and moral capacities that depend on this mastery, and discuss recent empirical research that either supports or apparently disagrees with the claim that animals, even those we (...) consider intelligent, are limited in these respects. My discussion is built around observations extracted from Wittgenstein. (shrink)

Under review. Submitted for habilitation in psychology.

This paper attempts to demonstrate that the logical problematic of signification, has a very dangerous socio-political effect due to the ontological implication that is connected to the signification of terms in logic. It expounds the notion of signification in Formal Logic as exposed by William of Ockham. It thus, employs this notion of signification of terms, to discuss the term “Fulani”, to show the danger potent in distorting the signification of the term “Fulani” as in every conventional and connotative terms. (...) This work claims that as a result of the connection between logic and ontology, conceptualization and perception, names and reality, the distortion of terms, which are the building blocks of propositions in logic could lead to a dangerous cognition and perception of ontological realities. To this end, it posits a critique on the dangerous change in the signification of the term “Fulani”, in the conceptualization and perception of present day Nigeria people, of West Africa. A dangerous change, as this paper claims, if not speedily reconstructed and re-conceptualized, could lead to a disastrous situation in the socio-political reality of the Nigerian State. (shrink)

We consider the Lambek calculus, or noncommutative multiplicative intuitionistic linear logic, extended with iteration, or Kleene star, axiomatised by means of an$\omega $-rule, and prove that the derivability problem in this calculus is$\Pi _1^0$-hard. This solves a problem left open by Buszkowski (2007), who obtained the same complexity bound for infinitary action logic, which additionally includes additive conjunction and disjunction. As a by-product, we prove that any context-free language without the empty word can be generated by a Lambek grammar with (...) unique type assignment, without Lambek’s nonemptiness restriction imposed (cf. Safiullin, 2007). (shrink)

A metainference is usually understood as a pair consisting of a collection of inferences, called premises, and a single inference, called conclusion. In the last few years, much attention has been paid to the study of metainferences—and, in particular, to the question of what are the valid metainferences of a given logic. So far, however, this study has been done in quite a poor language. Our usual sequent calculi have no way to represent, e.g. negations, disjunctions or conjunctions of inferences. (...) In this paper we tackle this expressive issue. We assume some background sentential language as given and define what we call an inferential language, that is, a language whose atomic formulas are inferences. We provide a model-theoretic characterization of validity for this language—relative to some given characterization of validity for the background sentential language—and also a proof-theoretic analysis of validity. We argue that our novel language has fruitful philosophical applications. Lastly, we generalize some of our definitions and results to arbitrary metainferential levels. (shrink)

In one of their papers, Michael De and Hitoshi Omori observed that the notion of classical negation is not uniquely determined in the context of so-called Belnap-Dunn logic, and in fact there are 16 unary operations that qualify to be called classical negation. These varieties are due to different falsity conditions one may assume for classical negation. The aim of this paper is to observe that there is an interesting way to make sense of classical negation independent of falsity conditions. (...) We discuss two equivalent semantics, and offer a Hilbert-style system that is sound and complete with respect to the semantics. (shrink)

In a recent article, “Logical Consequence and Natural Language”, Michael Glanzberg claims that there is no relation of logical consequence in natural language (2015). The present paper counters that claim. I shall discuss Glanzberg’s arguments and show why they don’t hold. I further show how Glanzberg’s claims may be used to rather support the existence of logical consequence in natural language.

This dissertation is about the structure of thought. Following Gottlob Frege, I define a thought as the sort of content relevant to determining whether an assertion is true or false. The historical component of the dissertation involves interpreting Frege’s actual views on the structure of thought. I argue that Frege did not think that a thought has a unique decomposition into its component senses, but rather the same thought can be decomposed into senses in a variety of distinct ways. I (...) extend Frege’s position and use it to develop an account of the hierarchy of senses, the senses expressed by indexicals and demonstratives, and the distinction between logical and non-logical structure. I also discuss various connections with the nature of meta-representation, our capacity for reflective judgment, some aspects of the structure of conscious experience, the way we perceive regions of space and durations of time, and our conscious awareness of our own perceptions and events of thinking. (shrink)

In his Formal Logic, Arthur N. Prior declared that Jan Łukasiewicz's logical notation is ‘unquestionably the best logical symbolism for most purposes’. Whether he had a substantive, and...

This paper aims to reassess a notion in the works of the later Husserl that is both historically important and philosophically insightful, but remains understudied, namely, that of type. In opposition to a standard reading which treats Husserl’s type presentations as pre-conceptual habits, this paper argues that these representations are a specific kind of concept. More precisely, it shows that Husserl’s account of type presentations is akin to the contemporary prototype theory of concepts. This is historically important, since the predecessor (...) of the prototype theory is usually said to be Wittgenstein. From a philosophical standpoint, the paper shows that Husserl has an innovative account of the connection between type concepts and their extension. Contrary to the standard view of extensions as sets and thus sharp entities, Husserl develops a correlationalist theory of concepts, according to which, for the specific characteristics in the structure of a concept, there are corresponding characteristics in the arrangement of its members, and vice versa. According to this theory, while sharp concepts lead to sharp extensions, vague concepts such as (proto)type concepts lead to vague extensions. The paper presents this understanding of Husserl in detail and explains its philosophical significance. (shrink)

We present a generalization of the algebra-valued models of \ where the axioms of set theory are not necessarily mapped to the top element of an algebra, but may get intermediate values, in a set of designated values. Under this generalization there are many algebras which are neither Boolean, nor Heyting, but that still validate \.

An exclusive disjunction is true when exactly one of the disjuncts is true. In the case of the familiar binary exclusive disjunction, we have a formula occurring as the first disjunct and a formula occurring as the second disjunct, so, if what we have is two formula-tokens of the same formula-type—one formula occurring twice over, that is—the question arises as to whether, when that formula is true, to count the case as one in which exactly one of the disjuncts is (...) true, counting by type, or as a case in which two disjuncts are true, counting by token. The latter is the standard answer: counting by tokens. James McCawley once suggested that, when the exclusively disjunctive construction in natural language is at issue, the construction should be treated as involving a multigrade connective whose semantic treatment is sensitive to the set of disjuncts rather than the corresponding multiset. Without any commitment as to whether there actually is such a construction, and conceding that for obvious pragmatic reasons such ‘repeated disjunct’ cases would be at best highly marginal, we note that for the binary case, this requires a nonstandard answer—count by type rather than by token—to the earlier question, and thus, an idempotent exclusive disjunction connective. Section 2 explores that idea and Section 3, a further idempotent variant for which it is the propositions expressed by the disjuncts, rather than the disjuncts themselves, that get counted once only in the case of repetitions. Sections 1 and 4 respectively set the stage for these investigations and conclude the discussion. More detailed considerations of points arising from the discussion but otherwise in danger of interrupting the flow are deferred to a ‘Longer Notes’ appendix at the end. (shrink)

There has been a recent interest in hierarchical generalizations of classic incompleteness results. This paper provides evidence that such generalizations are readily obtainable from suitably formulated hierarchical versions of the principles used in the original proofs. By collecting such principles, we prove hierarchical versions of Mostowski’s theorem on independent formulae, Kripke’s theorem on flexible formulae, Woodin’s theorem on the universal algorithm, and a few related results. As a corollary, we obtain the expected result that the formula expressing “ $\mathrm {T}$ (...) is $\Sigma _n$ -ill” is a canonical example of a $\Sigma _{n+1}$ formula that is $\Pi _{n+1}$ -conservative over $\mathrm {T}$. (shrink)

In this paper, we introduce an extension of the modal language with what we call the global quantificational modality [∀p]. In essence, this modality combines the propositional quantifier ∀p with the global modality A: [∀p] plays the same role as the compound modality ∀pA. Unlike the propositional quantifier by itself, the global quantificational modality can be straightforwardly interpreted in any Boolean Algebra Expansion (BAE). We present a logic GQM for this language and prove that it is complete with respect to (...) the intended algebraic semantics. This logic enables a conceptual shift, as what have traditionally been called different “modal logics” now become [∀p]-universal theories over the base logic GQM: instead of defining a new logic with an axiom schema such as □φ→□□φ, one reasons in GQM about what follows from the globally quantified formula [∀p](□p→□□p). (shrink)

The paper studies the containment companion of a logic \. This consists of the consequence relation \ which satisfies all the inferences of \, where the variables of the conclusion are contained into those of the set of premises, in case this is not inconsistent. In accordance with the work started in [10], we show that a different generalization of the Płonka sum construction, adapted from algebras to logical matrices, allows to provide a matrix-based semantics for containment logics. In particular, (...) we provide an appropriate completeness theorem for a wide family of containment logics, and we show how to produce a complete Hilbert style axiomatization. (shrink)

L.L. Maksimova and L. Esakia, V. Meskhi showed that the modal logic \ has exactly 5 pretabular extensions PM1–PM5. In this paper, we study the problem of unification for all given logics. We showed that PM2 and PM3 have finitary, and PM1, PM4, PM5 have unitary types of unification. Complete sets of unifiers in logics are described.

The aim of this article is to study the notion of derivability and its semantic counterpart in the context of non-transitive and non-reflexive substructural logics. For this purpose we focus on the study cases of the logics _S__T_ and _T__S_. In this respect, we show that this notion doesn’t coincide, in general, with a nowadays broadly used semantic approach towards metainferential validity: the notion of local validity. Following this, and building on some previous work by Humberstone, we prove that in (...) these systems derivability can be characterized in terms of a notion we call absolute global validity. However, arriving at these results doesn’t lead us to disregard local validity. First, because we discuss the conditions under which local, and also global validity, can be expected to coincide with derivability. Secondly, because we show how taking into account certain families of valuations can be useful to describe derivability for different calculi used to present _S__T_ and _T__S_. (shrink)

We show that under the assumption of the existence of the canonical inner model with one Woodin cardinal$M_1$, there is a model of$\mathsf {ZFC}$in which$\mbox {NS}_{\omega _{1}}$is$\aleph _2$-saturated and${\Delta }_{1}$-definable with$\omega _1$as a parameter which answers a question of S. D. Friedman and L. Wu. We also show that starting from an arbitrary universe with a Woodin cardinal, there is a model with$\mbox {NS}_{\omega _{1}}$saturated and${\Delta }_{1}$-definable with a ladder system$\vec {C}$and a full Suslin treeTas parameters. Both results rely on (...) a new coding technique whose presentation is the main goal of this article. (shrink)

According to the structured theory of propositions, if two sentences express the same proposition, then they have the same syntactic structure, with corresponding syntactic constituents expressing the same entities. A number of philosophers have recently focused attention on a powerful argument against this theory, based on a result by Bertrand Russell, which shows that the theory of structured propositions is inconsistent in higher order-logic. This paper explores a response to this argument, which involves restricting the scope of the claim that (...) propositions are structured, so that it does not hold for all propositions whatsoever, but only for those which are expressible using closed sentences of a given formal language. We call this restricted principle Closed Structure, and show that it is consistent in classical higher-order logic. As a schematic principle, the strength of Closed Structure is dependent on the chosen language. For its consistency to be philosophically significant, it also needs to be consistent in every extension of the language which the theorist of structured propositions is apt to accept. But, we go on to show, Closed Structure is in fact inconsistent in a very natural extension of the standard language of higher-order logic, which adds resources for plural talk of propositions. We conclude that this particular strategy of restricting the scope of the claim that propositions are structured is not a compelling response to the argument based on Russell’s result, though we note that for some applications, for instance to propositional attitudes, a restricted thesis in the vicinity may hold some promise. (shrink)

This sentence G ↔ ¬(F ⊢ G) and its negation G ↔ ~(F ⊢ ¬G) are shown to meet the conventional definition of incompleteness: Incomplete(T) ↔ ∃φ ((T ⊬ φ) ∧ (T ⊬ ¬φ)). They meet conventional definition of incompleteness because neither the sentence nor its negation is provable in F (or any other formal system). -- .

Peano was one of the driving forces behind the development of the current mathematical formalism. In this paper, we study his particular approach to notational design and present some original features of his notations. To explain the motivations underlying Peano's approach, we first present his view of logic as a method of analysis and his desire for a rigorous and concise symbolism to represent mathematical ideas. On the basis of both his practice and his explicit reflections on notations, we discuss (...) the principles that guided Peano's introduction of new symbols, the choice of characters, and the layout of formulas. Finally, we take a closer look, from a systematic and historical perspective, at one of Peano's most striking innovations, his use of dots for the grouping of subformulas. (shrink)

This work will focus on Józef Maria Bocheński’s inclination towards seeing the world and its logical structure from the point of view of ontology. In section 2, we shall discuss the perception of the world deriving from Bocheński, while in the third section – issues of its logical structure will be dealt with. In section 4, we will present a formal framework of the structure of the world.

This paper develops a theory of propositional identity which distinguishes necessarily equivalent propositions that differ in subject-matter. Rather than forming a Boolean lattice as in extensional and intensional semantic theories, the space of propositions forms a non-interlaced bilattice. After motivating a departure from tradition by way of a number of plausible principles for subject-matter, I will provide a Finean state semantics for a novel theory of propositions, presenting arguments against the convexity and nonvacuity constraints which Fine (2016, 2017a,b) introduces. I (...) will then move to compare the resulting logic of propositional identity (PI) with Correia’s (2016) logic of generalised identity (GI), as well as the first degree fragment of Angell’s (1989) logic of analytic containment (AC). The paper concludes by extending PI to include axioms and rules for a subject-matter operator, providing a much broader theory of subject-matter than the principles with which I will begin. (shrink)

We explore the problems that confront any attempt to explain or explicate exactly what a primitive logical rule of inference is, or consists in. We arrive at a proposed solution that places a surprisingly heavy load on the prospect of being able to understand and deal with specifications of rules that are essentially self-referring. That is, any rule $\rho $ is to be understood via a specification that involves, embedded within it, reference to rule $\rho $ itself. Just how we (...) arrive at this position is explained by reference to familiar rules as well as less familiar ones with unusual features. An inquiry of this kind is surprisingly absent from the foundations of inferentialism—the view that meanings of expressions are to be characterized by the rules of inference that govern them. (shrink)

The main objective of this paper is devoted to two main parts. First, the paper introduces logical interpretations of classical structures of opposition that are constructed as extensions of the square of opposition. Blanché’s hexagon as well as two cubes of opposition proposed by Morreti and pairs Keynes–Johnson will be introduced. The second part of this paper is dedicated to a graded extension of the Aristotle’s square and Peterson’s square of opposition with intermediate quantifiers. These quantifiers are linguistic expressions such (...) as “most”, “many”, “a few”, and “almost all”, and they correspond to what are often called “fuzzy quantifiers” in the literature. The graded Peterson’s cube of opposition, which describes properties between two graded squares, will be discussed at the end of this paper. (shrink)

In this paper, first, we determine the number of sublogics of variable inclusion of an arbitrary finitary logic ⊢ with a composition term. Then, we investigate their position into the lattice of co...

In this paper, I review the motivation of connexive and strongly connexive logics, and I investigate the question why it is so hard to achieve those properties in a logic with a well motivated semantic theory. My answer is that strong connexivity, and even just weak connexivity, is too stringent a requirement. I introduce the notion of humble connexivity, which in essence is the idea to restrict the connexive requirements to possible antecedents. I show that this restriction can be well (...) motivated, while it still leaves us with a set of requirements that are far from trivial. In fact, formalizing the idea of humble connexivity is not as straightforward as one might expect, and I offer three different proposals. I examine some well known logics to determine whether they are humbly connexive or not, and I end with a more wide-focused view on the logical landscape seen through the lens of humble connexivity. (shrink)

The idea of rejection originated by Aristotle. The notion of rejection was introduced into formal logic by Łukasiewicz. He applied it to complete syntactic characterization of deductive systems using an axiomatic method of rejection of propositions. The paper gives not only genesis, but also development and generalization of the notion of rejection. It also emphasizes the methodological approach to biaspectual axiomatic method of characterization of deductive systems as acceptance (asserted) systems and rejection (refutation) systems, introduced by Łukasiewicz and developed by (...) his student Słupecki, the pioneers of the method, which becomes relevant in modern approaches to logic. (shrink)

With reference to Polish logical-philosophical tradition two formal theories of language syntax have been sketched and then compared with each other. The first theory is based on the assumption that the basic linguistic stratum is constituted by object-tokens (concrete objects perceived through the senses) and that the types of such objects (ideal objects) are derivative constructs. The other is founded on an opposite philosophical orientation. The two theories are equivalent. The main conclusion is that in syntactic researches it is redundant (...) to postulate the existence of abstract linguistic entities. Earlier, in a slightly different form, the idea was presented in paper "Logiczne podstawy ontologii składni języka" (1988). (shrink)

Sentences containing definite descriptions, expressions of the form ‘The F’, can be formalised using a binary quantifier ι that forms a formula out of two predicates, where ιx[F, G] is read as ‘The F is G’. This is an innovation over the usual formalisation of definite descriptions with a term forming operator. The present paper compares the two approaches. After a brief overview of the system INFι of intuitionist negative free logic extended by such a quantifier, which was presented in (...) (Kürbis 2019), INFι is first compared to a system of Tennant’s and an axiomatic treatment of a term forming ι operator within intuitionist negative free logic. Both systems are shown to be equivalent to the subsystem of INFι in which the G of ιx[F, G] is restricted to identity. INFι is then compared to an intuitionist version of a system of Lambert’s which in addition to the term forming operator has an operator for predicate abstraction for indicating scope distinctions. The two systems will be shown to be equivalent through a translation between their respective languages. Advantages of the present approach over the alternatives are indicated in the discussion. (shrink)

The present work takes the decease of Horst Wessel as an opportunity to present and honour his work (and that of his group), which has not received the attention it deserves. The focus will be on works which might not be sufficiently well-known. Wessel was, as we aim to show, familiar with the international debate concerning logical and philosophical issues and strived to solve them by considering theories of logical consequence, a non-traditional theory of predication and the theory of logical (...) terms, all of which he developed in joint work with Alexander Sinowjew. Wessel had to significantly refine these theories in order to formulate his criticism towards alternative logics and to apply the theories to a treatment of intensional contexts. He was vehemently opposed to approaches which revised fundamental laws of classical logic. Questions concerning the history of Philosophy are addressed in Wessel’s criticism of the Kantian antinomies of pure reason, in Wessel’s contributions to the problem of universals and his analyses of fatalism, tychism and antifatalism. (shrink)

(Abstract - Inglês) Identity is traditionally taken to be a fundamental notion of our conceptual framework as well as a fundamental metaphysical component of entities. But as far as we make this claim we face ourselves with two problems: what is identity? And why would it be fundamental? These questions will guide us towards a discussion put forward by Bueno (2014), Krause and Arenhart (2015). Bueno holds that there are four aspects that make identity being fundamental: (1) identity is assumed (...) in every conceptual system; (2) it is required for a minimal characterisation of being an individual; (3) it cannot be defined; and (4) identity is required for quantification. On the other hand, Krause and Arenhart refuse the thesis that identity is fundamental replying to Bueno's arguments. In this dissertation we will deal with this debate. In the introduction we will deal with the first problem – what is identity? –, showing how this concept is traditionally understood, either for its metaphysical characteristics as for its formal account. After that we will deal with each of the four aspects defended by Bueno and challenged by Krause and Arenhart. After a critical presentation of each position we will also provide other arguments for the current debate. Finally we will outline an alternative view to those defended throughout this work. -/- (Resumo - Português) Tradicionalmente a identidade é adotada como uma noção fundamental de nosso arcabouço conceitual e como um componente metafísico fundamental das entidades. Mas logo ao fazermos essa afirmação nos deparamos com dois problemas: O que é a identidade? E por que ela seria fundamental? Estas perguntas irão nos guiar à discussão conduzida por Otávio Bueno (2014), Décio Krause e Jonas Arenhart (2015). Bueno defende que há quatro aspectos que fazem a identidade ser fundamental: (1) A identidade é pressuposta em todo sistema conceitual; (2) é requerida para uma caracterização mínima de indivíduo; (3) não pode ser definida; e (4) a identidade é requerida para a quantificação. Por outro lado, Krause e Arenhart recusam a tese de que a identidade seja fundamental, respondendo aos argumentos de Bueno. Neste trabalho iremos tratar desse debate. Na introdução iremos tratar do primeiro problema – O que é a identidade? –, mostrando como este conceito é tradicionalmente compreendido, tanto suas características metafísicas como também seu tratamento formal. Posteriormente iremos tratar de cada um dos quatro aspectos defendidos por Bueno e atacados por Krause e Arenhart. Além da exposição crítica de cada posição iremos também oferecer outros argumentos para o debate atual. Ao final iremos esboçar uma posição alternativa às defendidas ao longo do texto. (shrink)

The notion of contact algebra is one of the main tools in the region-based theory of space. It is an extension of Boolean algebra with an additional relation C, called contact. Standard models of contact algebras are topological and are the contact algebras of regular closed sets in a given topological space. In such a contact algebra we add the predicate of internal connectedness with the following meaning—a regular closed set is internally connected if and only if its interior is (...) a connected topological space in the subspace topology. We add also a ternary relation \ meaning that the intersection of the first two arguments is included in the third. In this paper the extension of a Boolean algebra with \, contact and internal connectedness, satisfying certain axioms, is called an extended contact algebra. We prove a representation theorem for extended contact algebras and thus obtain an axiomatization of the theory, consisting of the universal formulas, true in all topological contact algebras with added relations of internal connectedness and \. (shrink)

A 1971 paper by Roman Suszko, ‘Identity Connective and Modality’, claimed that a certain identity-free schema expressed the condition that there are at most two objects in the domain. Section 1 here gives that schema and enough of the background to this claim to explain Suszko’s own interest in it and related conditions—via non-Fregean logic, in which the objects in question are situations and the aim is to refrain from imposing this condition. Section 3 shows that the claim is false, (...) and suggests a diagnosis as to why it might have been made, in terms of quantifier scope distinctions as they bear on schematic formulations. In between, Section 2 discusses an issue brought up by this discussion but not involving the mistaken claim itself, and shows that Suszko was familiar with two different ways to set an upper or lower finite bound to the domain—a contrast which some contemporary readers may associate with David Lewis. (shrink)

Although the invariance criterion of logicality first emerged as a criterion of a purely mathematical interest, it has developed into a criterion of considerable linguistic and philosophical interest. In this paper I compare two different perspectives on this criterion. The first is the perspective of natural language. Here, the invariance criterion is measured by its success in capturing our linguistic intuitions about logicality and explaining our logical behavior in natural-linguistic settings. The second perspective is more theoretical. Here, the invariance criterion (...) is used as a tool for developing a theoretical foundation of logic, focused on a critical examination, explanation, and justification of its veridicality and modal force. (shrink)

In “Kant on Existence, Predication, and the Ontological Argument”, Hintikka argues that the so-called “Kant–Frege view” is wrong, for its supporters erroneously assume that for Kant ‘is’ is ambiguous. In this paper, I will first critically evaluate Hintikka’s arguments against the Kant–Frege view. Then, I will attempt to prove that Kant’s claim that existence is not a real predicate and Frege’s claim that existence is a quantifier are in fact logically interdependent. Finally, I will use the Kant–Frege view in order (...) to reconcile the various claims that Kant makes about existence. (shrink)

We analyse the two definitions of generalized quantifiers for logics of dependence and independence that have been proposed by F. Engström, comparing them with a more general, higher order definition of team quantifier. We show that Engström’s definitions can be identified, by means of appropriate lifts, with special classes of team quantifiers. We point out that the new team quantifiers express a quantitative and a qualitative component, while Engström’s quantifiers only range over the latter. We further argue that Engström’s definitions (...) are just embeddings of the first-order generalized quantifiers into team semantics, and fail to capture an adequate notion of team-theoretical generalized quantifier, save for the special cases in which the quantifiers are applied to flat formulas. We also raise several doubts concerning the meaningfulness of the monotone/nonmonotone distinction in this context. In the appendix we develop some proof theory for Engström’s quantifiers. (shrink)

It is often assumed that Aristotle, Boethius, Chrysippus, and other ancient logicians advocated a connexive conception of implication according to which no proposition entails, or is entailed by, its own negation. Thus Aristotle claimed that the proposition ‘if B is not great, B itself is great […] is impossible’. Similarly, Boethius maintained that two implications of the type ‘If p then r’ and ‘If p then not-r’ are incompatible. Furthermore, Chrysippus proclaimed a conditional to be ‘sound when the contradictory of (...) its consequent is incompatible with its antecedent’, a view which, in the opinion of S. McCall, entails the aforementioned theses of Aristotle and Boethius. Now a critical examination of the historical sources shows that the ancient logicians most likely meant their theses as applicable only to ‘normal’ conditionals with antecedents which are not self-contradictory. The corresponding restrictions of Aristotle’s and Boethius’ theses to such self-consistent antecedents, however, turn out to be theorems of ordinary modal logic and thus don’t give rise to any non-classical system of genuinely connexive logic,. (shrink)

It has been recently argued that the well-known square of opposition is a gathering that can be reduced to a one-dimensional figure, an ordered line segment of positive and negative integers [3]. However, one-dimensionality leads to some difficulties once the structure of opposed terms extends to more complex sets. An alternative algebraic semantics is proposed to solve the problem of dimensionality in a systematic way, namely: partition (or bitstring) semantics. Finally, an alternative geometry yields a new and unique pattern of (...) oppositions that proceeds with colored diagrams and an increasing set of bitstrings. (shrink)

This paper investigates a generalization of Boolean algebras which I call agglomerative algebras. It also outlines two conceptions of propositions according to which they form an agglomerative algebra but not a Boolean algebra with respect to conjunction and negation.

Operators can be compared in at least two respects: expressive strength and deductive strength. Inspired by Hintikka’s treatment of question embedding verbs, the variations of noncontingency operator, and also the various combinations of modal operators and Boolean connectives, we propose a logic with strong noncontingency operator as the only primitive modality. The novel operator is deductively but not expressively stronger than both noncontingency operator and essence operator, and expressively but not deductively weaker than the necessity operator. The frame-definability power of (...) this new logic is in between standard modal logic and noncontingency logic. A notion of bisimulation is proposed to characterize this logic within standard modal logic and first-order logic. Axiomatizations over various frame classes are presented, among which the minimal logic is related to the treatment of an alternative semantics of the agreement operator proposed by Lloyd Humberstone. (shrink)

The paper introduces a variant of connexive logic in which connexivity is extended from the interaction of negation with implication to the interaction of negation also with conjunction and disjunction. The logic is presented by two deductively equivalent methods: an axiomatic one and a natural-deduction one. Both are shown to be complete for a four-valued model theory.