What precisely are fragments of classical first-order logic showing “modal” behaviour? Perhaps the most influential answer is that of Gabbay 1981, which identifies them with so-called “finite-variable fragments”, using only some fixed finite number of variables (free or bound). This view-point has been endorsed by many authors (cf. van Benthem 1991). We will investigate these fragments, and find that, illuminating and interesting though they are, they lack the required nice behaviour in our sense. (Several new negative results support this claim.) (...) As a counterproposal, then, we define a large fragment of predicate logic characterized by its use of only bounded quantification. This so-called guarded fragment enjoys the above nice properties, including decidability, through an effectively bounded finite model property. (These are new results, obtained by generalizing notions and techniques from modal logic.) Moreover, its own internal finite variable hierarchy turns out to work well. Finally, we shall make another move. The above analogy works both ways. Modal operators are like quantifiers, but quantifiers are also like modal operators. This observation inspires a generalized semantics for first-order predicate logic with accessibility constraints on available assignments (cf. N´emeti 1986, 1992) which moves the earlier quantifier restrictions into the semantics. This provides a fresh look at the landscape of possible predicate logics, including candidates sharing various desirable features with basic modal logic – in particular, its decidability. (shrink)

The recent investigations into knowledge and its elements viz facts, skills and objects have become prominent in various subfields of philosophy and other areas like linguistics, cognitive science, neuroscience and artificial intelligence. These investigations have been mainly on understanding the relation between the intentionality and its referential entities to know how they enrich knowledge with their existence. This article starts with an exploration of the fundamental aspects of judgemental sense from the knowledge origins perspective. To explain the consequences of this, (...) I start with reconstructing the notion of categorial intuitions described in Husserl’s sixth Logical Investigations by relating it to ‘knowledge origination’ as an intuitive fulfilment of signifying acts. This offers a relation of perceptual synthesis, operating implicitly among the signifying intentions upon grasping intended objects, in view of language structures such as copulas. This leads to the synthesis of intuitive aspects mainly from the categorial elements for a judgemental sense or thinking and the attitude from the very sphere of perception. The tension between categorial intuitions is understood as foundational acts and founded acts. Husserl’s sixth Logical Investigation describes the notion of passive synthesis, the genesis of categoriality in every realm of sensibility that allows one to formulate the relational role among the ‘act of knowing’ and phenomenological approaches to the judgemental sense. Thus, the investigation focuses on perceptual judgements and categories, which fulfils the judgemental sense of categorial elements and attitude. (shrink)

In recent years combinations of tense and modality have moved intothe focus of logical research. From a philosophical point of view, logical systems combining tense and modality are of interest because these logics have a wide field of application in original philosophical issues, for example in the theory of causation, of action, etc. But until now only methods yielding completeness results for propositional languages have been developed. In view of philosophical applications, analogous results with respect to languages of predicate (...) logic are desirable, and in this paper I present two such results. The main developments in this area can be split into two directions, differing in the question whether the ordering of time is world-independent or not. Semantically, this difference appears in the discussion whether T x W-frames or Kamp-frames (resp. Ockham-frames) provide a suitable semantics for combinations of tense and modality. Here, two calculi are presented, the first adequate with respect to Kamp-semantics, the second to T x Wsemantics. (Both calculi contain an appropriate version of Gabbay's irreflexivity rule.) Furthermore, the proposed constructions of canonical frames simplify some of those which have hitherto been discussed. (shrink)

Logicians have often suggested that the use of Euler-type diagrams has influenced the idea of the quantification of the predicate. This is mainly due to the fact that Euler-type diagrams display more information than is required in traditional syllogistics. The paper supports this argument and extends it by a further step: Euler-type diagrams not only illustrate the quantification of the predicate, but also solve problems of traditional proof theory, which prevented an overall quantification of the predicate. Thus, (...) Euler-type diagrams can be called the natural basis of syllogistic reasoning and can even go beyond. In the paper, these arguments are presented in connection with the book Nucleus Logicae Weisaniae by Johann Christian Lange from 1712. (shrink)

We prove that the theory of the extensional compositional truth predicate for the language of arithmetic with \Delta 0 -induction scheme for the truth predicate and the full arithmetical induction scheme is not conservative over Peano Arithmetic. In addition, we show that a slightly modified theory of truth actually proves the global reflection principle over the base theory.

In previous work by Baaz and Iemhoff, a Gentzen calculus for intuitionistic logic with existence predicate is presented that satisfies partial cut elimination and Craig's interpolation property; it is also conjectured that interpolation fails for the implication-free fragment. In this paper an equivalent calculus is introduced that satisfies full cut elimination and allows a direct proof of interpolation via Maehara's lemma. In this way, it is possible to obtain much simpler interpolants and to better understand and overcome the failure (...) of interpolation for the implication-free fragment. (shrink)

According to what I call the ‘Vagueness Thesis’ about belief, ‘believes’ is a vague predicate. On this view, our concept of belief admits of borderline cases: one can ‘half-believe’ something or be ‘in-between believing’ it. In this article, I argue that VT is false and present an alternative picture of belief. I begin by considering a case—held up as a central example of vague belief—in which someone sincerely claims something to be true and yet behaves in a variety of (...) other ways as if she believes that it is not. I argue that, even from the third-person perspective prioritised by proponents of VT, the case does not motivate VT. I present an alternative understanding of the case according to which the person in question believes as they say they do yet also has a belief-discordant implicit attitude otherwise. Moreover, I argue that, independently of the interpretation of any particular case, VT fails to accommodate the first-person perspective on belief. Belief is not only an item of one’s psychology that helps explain one’s behaviour; it is what one takes to be true. This fact about belief manifests itself in the nature of deliberation concerning whether to believe something and that of introspection regarding whether one believes something. Attending to these phenomena reveals that VT is not merely unmotivated, but untenable. (shrink)

In the last few decades many formal systems of fuzzy logics have been developed. Since the main differences between fuzzy and classical logics lie at the propositional level, the fuzzy predicate logics have developed more slowly (compared to the propositional ones). In this text we aim to promote interest in fuzzy predicate logics by contributing to the model theory of fuzzy predicate logics. First, we generalize the completeness theorem, then we use it to get results on conservative (...) extensions of theories and on witnessed models. (shrink)

The traditional square of opposition is generalized and extended to a cube of opposition covering and conveniently visualizing inter-sentential oppositions in relational syllogistic logic with the usual syllogistic logic sentences obtained as special cases. The cube comes about by considering Frege–Russell’s quantifier predicate logic with one relation comprising categorical syllogistic sentence forms. The relationships to Buridan’s octagon, to Aristotelian modal logic, and to Klein’s 4-group are discussed.GraphicThe photo shows a prototype sculpture for the cube.

Modal counterparts of intermediate predicate logics will be studied by means of algebraic devise. Our main tool will be a construction of algebraic semantics for modal logics from algebraic frames for predicate logics. Uncountably many examples of modal counterparts of intermediate predicate logics will be given.

Distinct from nominal metaphors, predicate metaphors entail metaphorical abstraction from concrete verbs, which generally involve more action and stronger motor simulation than nouns. It remains unclear whether and how the concrete, embodied aspects of verbs are connected with abstract, disembodied thinking in the brains of L2 learners. Since English predicate metaphors are unfamiliar to Chinese L2 learners, the study of embodiment effect on English predicate metaphor processing may provide new evidence for embodied cognition and categorization models that (...) remain controversial, and offer practical insights into L2 metaphor processing and pedagogy. Hence, we aim to investigate whether the embodiment of verbs, via the activation of sensorimotor information, influences two groups of L2 learners during their comprehension of conventional and novel predicate metaphors. The results show a significant effect of embodiment: a stronger facilitation for novel predicate metaphors in both higher-level and lower-level groups, and a weaker facilitation for conventional predicate metaphors in the lower-level group. The findings demonstrate preliminary evidence for a graded effect of embodiment on predicate metaphors processing, modulated by L2 proficiency and metaphor novelty. The study supports a hybrid view of embodied cognition and reveals that sensorimotor aspects of verbs may be the intermediate entity involved in the indirect categorization. (shrink)

Rational Pavelka logic extends Lukasiewicz infinitely valued logic by adding truth constants r̄ for rationals in [0, 1]. We show that this is a conservative extension. We note that this shows that provability degree can be defined in Lukasiewicz logic. We also give a counterexample to a soundness theorem of Belluce and Chang published in 1963.

Based on an analysis of the category of “infinite judgments” in Kant, we will introduce the logical hexagon of predicate negation. This hexagon allows us to visualize in a single diagram the general structure of both Kant’s solution of the antinomies of pure reason and his argument in favor of Transcendental Idealism.

For each intermediate propositional logicJ, J * denotes the least predicate extension ofJ. By the method of canonical models, the strongly Kripke completeness ofJ *+D(=x(p(x)q)xp(x)q) is shown in some cases including:1. J is tabular, 2. J is a subframe logic. A variant of Zakharyashchev's canonical formulas for intermediate logics is introduced to prove the second case.

Recent studies in semantics of modal and superintuitionistic predicate logics provided many examples of incompleteness, especially for Kripke semantics. So there is a problem: to find an appropriate possible- world semantics which is equivalent to Kripke semantics at the propositional level and which is strong enough to prove general completeness results. The present paper introduces a new semantics of Kripke metaframes' generalizing some earlier notions. The main innovation is in considering "n"-tuples of individuals as abstract "n"-dimensional vectors', together with (...) some transformations of these vectors. Soundness of the semantics is proved to be equivalent to some non- logical properties of metaframes; and thus we describe the maximal semantics of Kripke- type. (shrink)

Joan Weiner has recently claimed that Frege neither uses, nor has any need to use, a truth-predicate in his justification of the logical laws. She argues that because of the assimilation of sentences to proper names in his system, Frege does not need to make use of the Quinean device of semantic ascent in order to formulate the logical laws, and that the predicate ‘is the True’, which is used in Frege's justification, is not to be considered as (...) a truth-predicate, because it does not apply to true sentences or true thoughts. The present paper aims to show that Frege needs to use, and does use, a truth-predicate in this context. It is argued, first, that Frege needs to use a truthpredicate in order to show that the truth of the logical laws is evident from the senses of the sentences by means of which they are formulated, and second, that the predicate that he actually uses, ‘is the True’, must be considered as a truth-predicate in the relevant sense, because it can be used and is actually used by Frege to explain the truth-conditions of thoughts. To defend this interpretation, it is discussed whether the explanatory use of ‘is the True’ in Frege's system is compatible with his deflationary analysis of ‘true’. The paper's conclusion is that there is indeed a conflict here; but, from Frege's point of view, this conflict is due merely to the logical imperfection of natural language and does not affect the proper system but only its propaedeutic. (shrink)

We introduce Gentzen calculi for intuitionistic logic extended with an existence predicate. Such a logic was first introduced by Dana Scott, who provided a proof system for it in Hilbert style. We prove that the Gentzen calculus has cut elimination in so far that all cuts can be restricted to very simple ones. Applications of this logic to Skolemization, truth value logics and linear frames are also discussed.

Tarski's indefinability theorem shows us that truth is not definable in arithmetic. The requirement to define truth for a language in a stronger language (if contradiction is to be avoided) lapses for particularly weak languages. A weaker language, however, is not necessary for that lapse. It also lapses for an adequately weak theory. It turns out that the set of G{\"o}del numbers of sentences true in arithmetic modulo $n$ is definable in arithmetic modulo $n$.

This paper is devoted to the algebraization of an arithmetical predicate introduced by S. Feferman. To this purpose we investigate the equational class of Boolean algebras enriched with an operation (g=rtail), which translates such predicate, and an operation τ, which translates the usual predicate Theor. We deduce from the identities of this equational class some properties of (g=rtail) and some ties between (g=rtail) and τ; among these properties, let us point out a fixed-point theorem for a sufficiently (...) large class of (g=rtail)-τ polynomials. The last part of this paper concerns the duality theory for (g=rtail)-τ algebras. (shrink)

Summary We have considered complete consistent systems in the first‐oder predicate calculus with identity, and have studied the set of the models of such a system by means of the maximal consistent condition‐sets associated with the system. The results may be summarized thus: (a) A complete consistent system is no‐categorical (= categorical in the denumerable domain) if and only if for every n, the number of different conditions in n variables is finite (T10). (b) If a complete consistent system (...) has a model M with finite character (i.e. a model M such that every maximal consistent condition‐set satisfied in M has a finite basis), then this model M is uniquely characterized by the property that every other model is an arithmetic extension of M (T 5). (c) Every complete consistent system, which has only a denumerable number of different associated maximal consistent condition‐sets, has a model with finite character (T8). (shrink)

We consider the desirability, or otherwise, of various forms of induction in the light of certain principles and inductive methods within predicate uncertain reasoning. Our general conclusion is that there remain conflicts within the area whose resolution will require a deeper understanding of the fundamental relationship between individuals and properties.