In this paper we focus our attention on tableau methods for propositional interval temporal logics. These logics provide a natural framework for representing and reasoning about temporal properties in several areas of computer science. However, while various tableau methods have been developed for linear and branching time point-based temporal logics, not much work has been done on tableau methods for interval-based ones. We develop a general tableau method for Venema's \cdt\ logic (...) interpreted over partial orders (\nsbcdt\ for short). It combines features of the classical tableau method for first-order logic with those of explicit tableau methods for modal logics with constraint label management, and it can be easily tailored to most propositional interval temporal logics proposed in the literature. We prove its soundness and completeness, and we show how it has been implemented. (shrink)

In this paper, we investigate the expressiveness of the variety of propositional interval neighborhood logics , we establish their decidability on linearly ordered domains and some important subclasses, and we prove the undecidability of a number of extensions of PNL with additional modalities over interval relations. All together, we show that PNL form a quite expressive and nearly maximal decidable fragment of Halpern–Shoham’s interval logic HS.

We survey main developments, results, and open problems on interval temporal logics and duration calculi. We present various formal systems studied in the literature and discuss their distinctive features, emphasizing on expressiveness, axiomatic systems, and (un)decidability results.

We introduce and study hierarchies of extensions of the propositional modal and temporal languages with pairs of new syntactic devices: point of reference-reference pointer which enable semantic references to be made within a formula. We propose three different but equivalent semantics for the extended languages, discuss and compare their expressiveness. The languages with reference pointers are shown to have great expressive power (especially when their frugal syntax is taken into account), perspicuous semantics, and simple deductive systems. For instance, (...) Kamp's and Stavi's temporal operators, as well as nominals (names, clock variables), are definable in them. Universal validity in these languages is proved undecidable. The basic modal and temporal logics with reference pointers are uniformly axiomatized and a strong completeness theorem is proved for them and extended to some classes of their extensions. (shrink)

A logic of intervals is proposed akin to the one published by Hamblin (Hamblin (1969) and (1971)). Like Hamblin's, the present system is also based on a single primitive. However, the work presented here differs from Hamblin's in a number of respects. Most importantly, the present system is explicitly based on mereological ideas in such a way that not only are the two notions of abutment and temporal order involved in Hamblin's primitive two-place relation "abuts at the earlier end" (...) distinguished ; the temporal ordering itself is built up from a symmetric mereological primitive. The present system is shown to be complete. (shrink)

Future Logic is an original, and wide-ranging treatise of formal logic. It deals with deduction and induction, of categorical and conditional propositions, involving the natural, temporal, extensional, and logical modalities. Traditional and Modern logic have covered in detail only formal deduction from actual categoricals, or from logical conditionals (conjunctives, hypotheticals, and disjunctives). Deduction from modal categoricals has also been considered, though very vaguely and roughly; whereas deduction from natural, temporal and extensional forms of conditioning has been all but (...) totally ignored. As for induction, apart from the elucidation of adductive processes (the scientific method), almost no formal work has been done. This is the first work ever to strictly formalize the inductive processes of generalization and particularization, through the novel methods of factorial analysis, factor selection and formula revision. This is the first work ever to develop a formal logic of the natural, temporal and extensional types of conditioning (as distinct from logical conditioning), including their production from modal categorical premises. Future Logic contains a great many other new discoveries, organized into a unified, consistent and empirical system, with precise definitions of the various categories and types of modality (including logical modality), and full awareness of the epistemological and ontological issues involved. Though strictly formal, it uses ordinary language, wherever symbols can be avoided. Among its other contributions: a full list of the valid modal syllogisms (which is more restrictive than previous lists); the main formalities of the logic of change (which introduces a dynamic instead of merely static approach to classification); the first formal definitions of the modal types of causality; a new theory of class logic, free of the Russell Paradox; as well as a critical review of modern metalogic. But it is impossible to list briefly all the innovations in logical science — and therefore, epistemology and ontology — this book presents; it has to be read for its scope to be appreciated. (shrink)

In this article we provide a mathematical model of Kant?s temporal continuum that satisfies the (not obviously consistent) synthetic a priori principles for time that Kant lists in the Critique of pure Reason (CPR), the Metaphysical Foundations of Natural Science (MFNS), the Opus Postumum and the notes and frag- ments published after his death. The continuum so obtained has some affinities with the Brouwerian continuum, but it also has ‘infinitesimal intervals’ consisting of nilpotent infinitesimals, which capture Kant’s theory of (...) rest and motion in MFNS. While constructing the model, we establish a concordance between the informal notions of Kant?s theory of the temporal continuum, and formal correlates to these notions in the mathematical theory. Our mathematical reconstruction of Kant?s theory of time allows us to understand what ?faculties and functions? must be in place for time to satisfy all the synthetic a priori principles for time mentioned. We have presented here a mathematically precise account of Kant?s transcendental argument for time in the CPR and of the rela- tion between the categories, the synthetic a priori principles for time, and the unity of apperception; the most precise account of this relation to date. We focus our exposition on a mathematical analysis of Kant’s informal terminology, but for reasons of space, most theorems are explained but not formally proven; formal proofs are available in (Pinosio, 2017). The analysis presented in this paper is related to the more general project of developing a formalization of Kant’s critical philosophy (Achourioti & van Lambalgen, 2011). A formal approach can shed light on the most controversial concepts of Kant’s theoretical philosophy, and is a valuable exegetical tool in its own right. However, we wish to make clear that mathematical formalization cannot displace traditional exegetical methods, but that it is rather an exegetical tool in its own right, which works best when it is coupled with a keen awareness of the subtleties involved in understanding the philosophical issues at hand. In this case, a virtuous ?hermeneutic circle? between mathematical formalization and philosophical discourse arises. (shrink)

This work aims to make tense logic a more robust tool for ontologists, philosophers, knowledge engineers and programmers by outlining a fusion of tense logic and ontology of time. In order to make tense logic better understandable, the central formal primitives of standard tense logic are derived as theorems from an informal and intuitive ontology of time. In order to make formulation of temporal propositions easier, temporal operators that were introduced by Georg Henrik von Wright are developed, and (...) mapped to the ontology of time. (shrink)

A “conceptual spaces” approach is used to formalize Aristotle’s main intuitions about time and change, and other ideas about temporal points of view. That approach has been used in earlier studies about points of view. Properties of entities are represented by locations in multidimensional conceptual spaces; and concepts of entities are identified with subsets or regions of conceptual spaces. The dimensions of the spaces, called “determinables”, are qualities in a very general sense. A temporal element is introduced by (...) adding a time variable to state functions that map entities into conceptual spaces. That way, states may have some permanency or stability around time instances. Following Aristotle’s intuitions, changes and events will not be necessarily instant phenomena, instead they could be processual and interval dependent. Change is defined relatively to the interval during which the change is taking place. Time intervals themselves are taken to represent points of view. To have a point of view is to look at the world as it is in the selected interval. Many important concepts are relativized to intervals, for instance change, events, identity, ontology, potentiality, etc. The definition of points of view as intervals allows to compare points of view in relation to all these concepts. The conceptual space approach has an immediate semantic and structural character, but it is tempting to develop also logics to describe them. A formal language is introduced to show how this could be done. (shrink)

ABSTRACT: A detailed presentation of Stoic logic, part one, including their theories of propositions (or assertibles, Greek: axiomata), demonstratives, temporal truth, simple propositions, non-simple propositions(conjunction, disjunction, conditional), quantified propositions, logical truths, modal logic, and general theory of arguments (including definition, validity, soundness, classification of invalid arguments).

ABSTRACT: An introduction to Stoic logic. Stoic logic can in many respects be regarded as a fore-runner of modern propositional logic. I discuss: 1. the Stoic notion of sayables or meanings (lekta); the Stoic assertibles (axiomata) and their similarities and differences to modern propositions; the time-dependency of their truth; 2.-3. assertibles with demonstratives and quantified assertibles and their truth-conditions; truth-functionality of negations and conjunctions; non-truth-functionality of disjunctions and conditionals; language regimentation and ‘bracketing’ devices; Stoic basic principles of propositional (...) logic; 4. Stoic modal logic; 5. Stoic theory of arguments: two premisses requirement; validity and soundness; 6. Stoic syllogistic or theory of formally valid arguments: a reconstruction of the Stoic deductive system, which consisted of accounts of five types of indemonstrable syllogisms, which function as nullary argumental rules that identify indemonstrables or axioms of the system, and four deductive rules (themata) by which certain complex arguments can be reduced to indemonstrables and thus shown to be formally valid themselves; 7. arguments that were considered as non-syllogistically valid (subsyllogistic and unmethodically concluding arguments). Their validity was explained by recourse to formally valid arguments. (shrink)

The Logic of Causation: Definition, Induction and Deduction of Deterministic Causality is a treatise of formal logic and of aetiology. It is an original and wide-ranging investigation of the definition of causation (deterministic causality) in all its forms, and of the deduction and induction of such forms. The work was carried out in three phases over a dozen years (1998-2010), each phase introducing more sophisticated methods than the previous to solve outstanding problems. This study was intended as part of a (...) larger work on causal logic, which additionally treats volition and allied cause-effect relations (2004). The Logic of Causation deals with the main technicalities relating to reasoning about causation. Once all the deductive characteristics of causation in all its forms have been treated, and we have gained an understanding as to how it is induced, we are able to discuss more intelligently its epistemological and ontological status. In this context, past theories of causation are reviewed and evaluated (although some of the issues involved here can only be fully dealt with in a larger perspective, taking volition and other aspects of causality into consideration, as done in Volition and Allied Causal Concepts). Phase I: Macroanalysis. Starting with the paradigm of causation, its most obvious and strongest form, we can by abstraction of its defining components distinguish four genera of causation, or generic determinations, namely: complete, partial, necessary and contingent causation. When these genera and their negations are combined together in every which way, and tested for consistency, it is found that only four species of causation, or specific determinations, remain conceivable. The concept of causation thus gives rise to a number of positive and negative propositional forms, which can be studied in detail with relative ease because they are compounds of conjunctive and conditional propositions whose properties are already well known to logicians. The logical relations (oppositions) between the various determinations (and their negations) are investigated, as well as their respective implications (eductions). Thereafter, their interactions (in syllogistic reasoning) are treated in the most rigorous manner. The main question we try to answer here is: is (or when is) the cause of a cause of something itself a cause of that thing, and if so to what degree? The figures and moods of positive causative syllogism are listed exhaustively; and the resulting arguments validated or invalidated, as the case may be. In this context, a general and sure method of evaluation called ‘matricial analysis’ (macroanalysis) is introduced. Because this (initial) method is cumbersome, it is used as little as possible – the remaining cases being evaluated by means of reduction. Phase II: Microanalysis. Seeing various difficulties encountered in the first phase, and the fact that some issues were left unresolved in it, a more precise method is developed in the second phase, capable of systematically answering most outstanding questions. This improved matricial analysis (microanalysis) is based on tabular prediction of all logically conceivable combinations and permutations of conjunctions between two or more items and their negations (grand matrices). Each such possible combination is called a ‘modus’ and is assigned a permanent number within the framework concerned (for 2, 3, or more items). This allows us to identify each distinct (causative or other, positive or negative) propositional form with a number of alternative moduses. This technique greatly facilitates all work with causative and related forms, allowing us to systematically consider their eductions, oppositions, and syllogistic combinations. In fact, it constitutes a most radical approach not only to causative propositions and their derivatives, but perhaps more importantly to their constituent conditional propositions. Moreover, it is not limited to logical conditioning and causation, but is equally applicable to other modes of modality, including extensional, natural, temporal and spatial conditioning and causation. From the results obtained, we are able to settle with formal certainty most of the historically controversial issues relating to causation. Phase III: Software Assisted Analysis. The approach in the second phase was very ‘manual’ and time consuming; the third phase is intended to ‘mechanize’ much of the work involved by means of spreadsheets (to begin with). This increases reliability of calculations (though no errors were found, in fact) – but also allows for a wider scope. Indeed, we are now able to produce a larger, 4-item grand matrix, and on its basis find the moduses of causative and other forms needed to investigate 4-item syllogism. As well, now each modus can be interpreted with greater precision and causation can be more precisely defined and treated. In this latest phase, the research is brought to a successful finish! Its main ambition, to obtain a complete and reliable listing of all 3-item and 4-item causative syllogisms, being truly fulfilled. This was made technically feasible, in spite of limitations in computer software and hardware, by cutting up problems into smaller pieces. For every mood of the syllogism, it was thus possible to scan for conclusions ‘mechanically’ (using spreadsheets), testing all forms of causative and preventive conclusions. Until now, this job could only be done ‘manually’, and therefore not exhaustively and with certainty. It took over 72’000 pages of spreadsheets to generate the sought for conclusions. This is a historic breakthrough for causal logic and logic in general. Of course, not all conceivable issues are resolved. There is still some work that needs doing, notably with regard to 5-item causative syllogism. But what has been achieved solves the core problem. The method for the resolution of all outstanding issues has definitely now been found and proven. The only obstacle to solving most of them is the amount of labor needed to produce the remaining (less important) tables. As for 5-item syllogism, bigger computer resources are also needed. (shrink)

ABSTRACT: Summary presentation of the surviving logic theories of Philo the Dialectician (aka Philo of Megara) and Diodorus Cronus, including some general remarks on propositional logical elements in their logic, a presentation of their theories of the conditional and a presentation of their modal theories, including a brief suggestion for a solution of the Master Argument.

Neutrosophy has been introduced some years ago by Florentin Smarandache as a new branch of philosophy dealing with “the origin, nature and scope of neutralities, as well as their interactions with different ideational spectra”. A variety of new theories have been developed on the basic principles of neutrosophy: among them is neutrosophic logics, a family of many-valued systems that can be regarded as a generalization of fuzzy logics. In this paper we present a critical introduction to neutrosophic (...) class='Hi'>logics, focusing on the problem of defining suitable neutrosophic propositional connectives and discussing the relationship between neutrosophic logics and other well-known frameworks for reasoning with uncertainty and vagueness, such as (intuitionistic and interval-valued) fuzzy systems and Belnap’s logic. (shrink)

Simple partial logic (=SPL) is, broadly speaking, an extensional logic which allows for the truth-value gap. First I give a system of propositional SPL by partializing classical logic, as well as extending it with several non-classical truth-functional operators. Second I show a way based on SPL to construct a system of tensed ontology, by representing tensed statements as two kinds of necessary statements in a linear model that consists of the present and future worlds. Finally I compare that way (...) with other two ways based on Łukasiewicz’s three-valued logic and branching temporal logic. (shrink)

ABSTRACT: The modal systems of the Stoic logician Chrysippus and the two Hellenistic logicians Philo and Diodorus Cronus have survived in a fragmentary state in several sources. From these it is clear that Chrysippus was acquainted with Philo’s and Diodorus’ modal notions, and also that he developed his own in contrast of Diodorus’ and in some way incorporated Philo’s. The goal of this paper is to reconstruct the three modal systems, including their modal definitions and modal theorems, and to make (...) clear the exact relations between them; moreover, to elucidate the philosophical reasons that may have led Chrysippus to modify his predessors’ modal concept in the way he did. It becomes apparent that Chrysippus skillfully combined Philo’s and Diodorus’ modal notions, with making only a minimal change to Diodorus’ concept of possibility; and that he thus obtained a modal system of modalities (logical and physical) which fit perfectly fit into Stoic philosophy. (shrink)

Logical analysis of the applicability of nominals (which are introduced by hybrid logic) in the formal descriptions of the world (within modern knowledge representation and semantics-based systems) is very important because nominals, as second sorts of propositional symbols, can support logical identification of the described world at specific [temporal and/or spacial] states. This paper will focus on answering the philosophical-logical question of ‘how a fundamental world description in description logic (DL) and a nominal can be related to each (...) other?’. Based on my assumption that nominals can support more adequate identification of the world in DL, this paper will deal with the concept of ‘world identification’. Accordingly, based on a logical-terminological analysis of nominals, the paper will analyse hybridised fundamental world descriptions. The research will finally reach the idea that we can have a hybrid description logic based on the analysed concepts. (shrink)

ABSTRACT A complete axiomatic system CTLrp is introduced for a temporal logic for finitely branching ω+ -trees in a language extended with so called reference pointers. Syntactic and semantic interpretations are constructed for the branching time computation tree logic CTL* into CTLrp. In particular, that yields a complete axiomatization for the translations of all valid CTL*-formulae. Thus, the temporal logic with reference pointers is brought forward as a simpler (with no path quantifiers), but in a way more expressive (...) medium for reasoning about branching time. (shrink)

A complete axiomatic system CTL$_{rp}$ is introduced for a temporal logic for finitely branching $\omega^+$-trees in a temporal language extended with so called reference pointers. Syntactic and semantic interpretations are constructed for the branching time computation tree logic CTL$^{*}$ into CTL$_{rp}$. In particular, that yields a complete axiomatization for the translations of all valid CTL$^{*}$-formulae. Thus, the temporal logic with reference pointers is brought forward as a simpler (with no path quantifiers), but in a way more expressive (...) medium for reasoning about branching time. (shrink)

Complex human reasoning involves minimal abilities to extract conclusions implied in the available information. These abilities are considered “deductive” because they exemplify certain abstract relations among propositions or probabilities called deductive arguments. However, the electrophysiological dynamics which supports such complex cognitive pro- cesses has not been addressed yet. In this work we consider typically deductive logico- probabilistically valid inferences and aim to verify or refute their electrophysiological functional connectivity differences from invalid inferences with the same content (same relational variables, same (...) stimuli, same relevant and salient features). We recorded the brain electrophysiological activity of 20 participants (age 1⁄4 20.35 ± 3.23) by means of an MEG system during two consecutive reasoning tasks: a search task (invalid condition) without any specific deductive rules to follow, and a logically valid deductive task (valid condition) with explicit deductive rules as instructions. We calculated the functional connectivity (FC) for each condition and conducted a seed-based analysis in a set of cortical regions of interest. Finally, we used a cluster-based permutation test to compare the dif- ferences between logically valid and invalid conditions in terms of FC. As a first novel result we found higher FC for valid condition in beta band between regions of interest and left prefrontal, temporal, parietal, and cingulate structures. FC analysis allows a second novel result which is the definition of a propositional network with operculo-cingular, parietal and medial nodes, specifically including disputed medial deductive “core” areas. The experiment discloses measurable cortical processes which do not depend on content but on truth-functional propositional operators. These experimental novelties may contribute to understand the cortical bases of deductive processes. (shrink)

The basic principles of Cipra's metaphysics (according to his book "Metamorphoses of Metaphysics") are analyzed with respect to Cipra's request for the revision of classical logical principles (of identity, excluded middle and contradiction). In Cipra's metaphysics, the principle of identity holds for being, necessity and past only, the principle of excluded middle does not hold for coming-to-be, possibility and present, and the principle of contradiction does not hold for the actuality, reality (freedom) and future. A propositional and first-order (...) class='Hi'>temporal model and semantics are defined for such a concept of metaphysical time. The propositional ockhamistic branching time model is extended, in a first-order model, with a non-empty set of object shapes and an equivalence relation between object shapes in time, so that, for example, different, previously equivalent object shapes can in future contradict one another. (shrink)

PUTNAM has made highly regarded contributions to mathematics, to philosophy of logic and to philosophy of science, and in this book he brings his ideas in these three areas to bear on the traditional philosophic problem of materialism versus (objective) idealism. The book assumes that contemporary science (mathematical and physical) is largely correct as far as it goes, or at least that it is rational to believe in it. The main thesis of the book is that consistent acceptance of contemporary (...) science requires the acceptance of some sort of Platonistic idealism affirming the existence of abstract, non-temporal, non-material, non-mental entities (numbers, scientific laws, mathematical formulas, etc.). The author is thus in direct opposition to the extreme materialism which had dominated philosophy of science in the first three quarters of this century. The book can be recommended to the scientifically literate, general reader whose acquaintance with these areas is limited to the literature of the 1950’s and before, when it had been assumed that empiricistic materialism was the only philosophy compatible with a scientific outlook. To this group the book presents an eye-opening challenge fulfilling the author’s intention of “shaking up preconceptions and stimulating further discussion”. QUINE’S book is not easy to read, partly because the level of sophistication fluctuates at high frequency between remote extremes and partly because of convoluted English prose style and devilish terminology. Almost all of the minor but troublesome technical errata in the first printing have been corrected [see reviews, e.g., the reviewer, Philos. Sci. 39 (1972), no. 1, 97–99]. In the opinion of the reviewer the book is not suitable for undergraduate instruction, and without external motivation few mathematicians are likely to have the patience to appreciate it. Nevertheless, a careful study of the book will more than repay the effort and one should expect to find frequent references to this book in coming years. (shrink)

This paper considers the question of what knowing a logical rule consists in. I defend the view that knowing a logical rule is having propositional knowledge. Many philosophers reject this view and argue for the alternative view that knowing a logical rule is, at least at the fundamental level, having a disposition to infer according to it. To motivate this dispositionalist view, its defenders often appeal to Carroll’s regress argument in ‘What the Tortoise Said to Achilles’. I show that (...) this dispositionalist view, and the regress that supposedly motivates it, operate with the wrong picture of what is involved in knowing a logical rule. In particular I show that it gives us the wrong picture of the relation between knowing a logical rule and actions of inferring according to it, as well as of the way in which knowing a logical rule might be a priori. (shrink)

This paper investigates logical aspects of combining linear orders as semantics for modal and temporal logics, with modalities for possible paths, resulting in a variety of branching time logics over classes of trees. Here we adopt a unified approach to the Priorean, Peircean and Ockhamist semantics for branching time logics, by considering them all as fragments of the latter, obtained as combinations, in various degrees, of languages and semantics for linear time with a modality for possible (...) paths. We then consider a hierarchy of natural classes of trees and bundled trees arising from a given class of linear orders and show that in general they provide different semantics. We also discuss transfer of definability from linear orders to trees and introduce a uniform translation from Priorean to Peircean formulae which transfers definability of properties of linear orders to definability of properties of all paths in trees. (shrink)

We develop an approach to temporal logic that replaces the traditional objective, agent- and event-independent notion of time with a constructive, event-dependent notion of time. We show how to make this event-dependent time entropic and hence well-defined. We use sheaf-theoretic techniques to render event-dependent time functorial and to construct memories as sequences of observed and constructed events with well-defined limits that maximize the consistency of categorizations assigned to objects appearing in memories. We then develop a condensed formalism that represents (...) memories as pure constructs from single events. We formulate an empirical hypothesis that human episodic memory implements a particular constructive functor. (shrink)

1) We will begin by offering a short introduction to Epistemic Logic and presenting Fitch’s paradox in an epistemic‑modal logic. (2) Then, we will proceed to presenting three Epistemic Temporal logical frameworks creat‑ ed by Hoshi (2009) : TPAL (Temporal Public Announcement Logic), TAPAL (Temporal Arbitrary Public Announcement Logic) and TPAL+P ! (Temporal Public Announcement Logic with Labeled Past Operators). We will show how Hoshi stated the Verificationist Thesis in the language of TAPAL and analyze his (...) argument on why this version of it is immune from paradox. (3) Edgington (1985) offered an interpretation of the Verificationist Thesis that blocks Fitch’s paradox and we will propose a way to formulate it in a TAPAL‑based lan‑ guage. The language we will use is a combination of TAPAL and TPAL+P ! with an Indefinite (Unlabeled) Past Operator (TAPAL+P !+P). Using indexed satisfi‑ ability relations (as introduced in (Wang 2010 ; 2011)) we will offer a prospec ‑ tive semantics for this language. We will investigate whether the tentative re‑ formulation of Edgington’s Verificationist Thesis in TAPAL+P !+P is free from paradox and adequate to Edgington’s ideas on how „all truths are knowable“ should be interpreted. (shrink)

Logic has sometimes been seen as an alternative to metaphysics and to speculation. In this paper it is argued that a different story should be told when it comes to temporal logic and tense-logic in particular. A. N. Prior’s first formulation of tense logic was mainly established in order to qualify the discussion of certain metaphysical and conceptual problems. Although temporal logic has now been developed in various abstract and rather technical ways, it may still serve as a (...) great help for anyone who wants to clarify the discussion of important existential questions like the nature of time, determinism, future contingency or freedom of choice. (shrink)

It is shown that the infinite-valued first-order Gödel logic G° based on the set of truth values {1/k: k ε w {0}} U {0} is not r.e. The logic G° is the same as that obtained from the Kripke semantics for first-order intuitionistic logic with constant domains and where the order structure of the model is linear. From this, the unaxiomatizability of Kröger's temporal logic of programs (even of the fragment without the nexttime operator O) and of the authors' (...) temporal logic of linear discrete time with gaps follows. (shrink)

We consider several natural fragments of the alternating-time temporal logics ATL* and ATL with restrictions on the nesting between temporal operators and strategic quantifiers. We develop optimal decision procedures for satisfiability in these fragments, showing that they have much lower complexities than the full languages. In particular, we prove that the satisfiability problem for state formulae in the full `strategically flat' fragment of ATL* is PSPACE-complete, whereas the satisfiability problems in the flat fragments of ATL and ATL$^{+}$ (...) are $\Sigma^P_3$-complete. We note that the nesting hierarchies for fragments of ATL* collapse in terms of expressiveness above nesting depth 1, hence our results cover all such fragments with lower complexities. (shrink)

The first-order temporal logics with □ and ○ of time structures isomorphic to ω (discrete linear time) and trees of ω-segments (linear time with branching gaps) and some of its fragments are compared: the first is not recursively axiomatizable. For the second, a cut-free complete sequent calculus is given, and from this, a resolution system is derived by the method of Maslov.

An examination of McTaggart’s [1908] argument for the unreality of time.

This tutorial is for beginners wanting to learn the basics of propositional logic; the simplest of the formal systems of logic. Leslie Allan introduces students to the nature of arguments, validity, formal proofs, logical operators and rules of inference. With many examples, Allan shows how these concepts are employed through the application of three different methods for proving the formal validity of arguments.

In this paper we critically review Correia’s and Rosenkranz’s Nothing to Come. A Defence of the Growing Block Theory of Time, published by Springer in 2018. By taking into account the essential reliance of the book on tense logic, we bring out the existence of a conflict between their logical axioms, that presuppose truth bivalence even for statements concerning future contingents, and the principle of groundedness that they also advocate. According to this principle, a proposition Q is now groundedly true (...) as long as sometimes in the future it will be the case that there exists something that makes Q true. However, if the events that occur in 2060 do not exist unrestrictedly (for us, here in 2021), what, in reality, can possibly ground the truth (or falsity) of Q? In the second part of the paper, we concentrate on some conceptual difficulties raised by their brilliant attempt to adapt the growing block view of reality to a relativistic setting, based on what they call bow-tie presentism, according to which for each spacetime point s only s plus the spacelike-related region with respect to s exists. By extending temporal logic into a relativity-friendly spatiotemporal logic, we conclude by noting that Correia and Rosenkranz’s Nothing to Come makes very important strides in showing that there are technical ways to develop the growing block of reality into an ontology that coheres with relativity theories perfectly well, while retaining most of the distinctive content of classical growing block theory. (shrink)

The five English words—sentence, proposition, judgment, statement, and fact—are central to coherent discussion in logic. However, each is ambiguous in that logicians use each with multiple normal meanings. Several of their meanings are vague in the sense of admitting borderline cases. In the course of displaying and describing the phenomena discussed using these words, this paper juxtaposes, distinguishes, and analyzes several senses of these and related words, focusing on a constellation of recommended senses. One of the purposes of this paper (...) is to demonstrate that ordinary English properly used has the resources for intricate and philosophically sound investigation of rather deep issues in logic and philosophy of language. No mathematical, logical, or linguistic symbols are used. Meanings need to be identified and clarified before being expressed in symbols. We hope to establish that clarity is served by deferring the extensive use of formalized or logically perfect languages until a solid “informal” foundation has been established. Questions of “ontological status”—e.g., whether propositions or sentences, or for that matter characters, numbers, truth-values, or instants, are “real entities”, are “idealizations”, or are “theoretical constructs”—plays no role in this paper. As is suggested by the title, this paper is written to be read aloud. -/- I hope that reading this aloud in groups will unite people in the enjoyment of the humanistic spirit of analytic philosophy. (shrink)

Entailment in propositional Gödel logics can be defined in a natural way. While all infinite sets of truth values yield the same sets of tautologies, the entailment relations differ. It is shown that there is a rich structure of infinite-valued Gödel logics, only one of which is compact. It is also shown that the compact infinite-valued Gödel logic is the only one which interpolates, and the only one with an r.e. entailment relation.

In my book Logical Form I outline some reasons for thinking that, in the sense of «logical form» that matters to logic, logical form is determined by truth conditions. This paper compares three theories of propositions that might be employed to substantiate the underlying notion of truth conditions: the naturalized propositions theory, the truthmaker theory, and the classificatory theory. Its aim is to show that, while the naturalized propositions theory and the truthmaker theory accord equally well with the idea that (...) logical form is determined by truth conditions, the classificatory theory is more problematic in some respects. (shrink)

It is shown that Gqp↑, the quantified propositional Gödel logic based on the truth-value set V↑ = {1 - 1/n : n≥1}∪{1}, is decidable. This result is obtained by reduction to Büchi's theory S1S. An alternative proof based on elimination of quantifiers is also given, which yields both an axiomatization and a characterization of Gqp↑ as the intersection of all finite-valued quantified propositional Gödel logics.

At least since Aristotle’s famous 'sea-battle' passages in On Interpretation 9, some substantial minority of philosophers has been attracted to the doctrine of the open future--the doctrine that future contingent statements are not true. But, prima facie, such views seem inconsistent with the following intuition: if something has happened, then (looking back) it was the case that it would happen. How can it be that, looking forwards, it isn’t true that there will be a sea battle, while also being true (...) that, looking backwards, it was the case that there would be a sea battle? This tension forms, in large part, what might be called the problem of future contingents. A dominant trend in temporal logic and semantic theorizing about future contingents seeks to validate both intuitions. Theorists in this tradition--including some interpretations of Aristotle, but paradigmatically, Thomason (1970), as well as more recent developments in Belnap, et. al (2001) and MacFarlane (2003, 2014)--have argued that the apparent tension between the intuitions is in fact merely apparent. In short, such theorists seek to maintain both of the following two theses: (i) the open future: Future contingents are not true, and (ii) retro-closure: From the fact that something is true, it follows that it was the case that it would be true. It is well-known that reflection on the problem of future contingents has in many ways been inspired by importantly parallel issues regarding divine foreknowledge and indeterminism. In this paper, we take up this perspective, and ask what accepting both the open future and retro-closure predicts about omniscience. When we theorize about a perfect knower, we are theorizing about what an ideal agent ought to believe. Our contention is that there isn’t an acceptable view of ideally rational belief given the assumptions of the open future and retro-closure, and thus this casts doubt on the conjunction of those assumptions. (shrink)

Dugundji proved in 1940 that most parts of standard modal systems cannot be characterized by a single finite deterministic matrix. In the eighties, Ivlev proposed a semantics of four-valued non-deterministic matrices (which he called quasi-matrices), in order to characterize a hierarchy of weak modal logics without the necessitation rule. In a previous paper, we extended some systems of Ivlev’s hierarchy, also proposing weaker six-valued systems in which the (T) axiom was replaced by the deontic (D) axiom. In this paper, (...) we propose even weaker systems, by eliminating both axioms, which are characterized by eight-valued non-deterministic matrices. In addition, we prove completeness for those new systems. It is natural to ask if a characterization by finite ordinary (deterministic) logical matrices would be possible for all those Ivlev-like systems. We will show that finite deterministic matrices do not characterize any of them. (shrink)

Justification logics are modal-like logics with the additional capability of recording the reason, or justification, for modalities in syntactic structures, called justification terms. Justification logics can be seen as explicit counterparts to modal logics. The behavior and interaction of agents in distributed system is often modeled using logics of knowledge and time. In this paper, we sketch some preliminary ideas on how the modal knowledge part of such logics of knowledge and time could be (...) replaced with an appropriate justification logic. (shrink)

In previous work, I introduced a complete axiomatization of classical non-tautologies based essentially on Łukasiewicz’s rejection method. The present paper provides a new, Hilbert-type axiomatization (along with related systems to axiomatize classical contradictions, non-contradictions, contingencies and non-contingencies respectively). This new system is mathematically less elegant, but the format of the inferential rules and the structure of the completeness proof possess some intrinsic interest and suggests instructive comparisons with the logic of tautologies.

The problem of approximating a propositional calculus is to find many-valued logics which are sound for the calculus (i.e., all theorems of the calculus are tautologies) with as few tautologies as possible. This has potential applications for representing (computationally complex) logics used in AI by (computationally easy) many-valued logics. It is investigated how far this method can be carried using (1) one or (2) an infinite sequence of many-valued logics. It is shown that the optimal (...) candidate matrices for (1) can be computed from the calculus. (shrink)

This paper corrects a mistake I saw students make but I have yet to see in print. The mistake is thinking that logically equivalent propositions have the same counterexamples—always. Of course, it is often the case that logically equivalent propositions have the same counterexamples: “every number that is prime is odd” has the same counterexamples as “every number that is not odd is not prime”. The set of numbers satisfying “prime but not odd” is the same as the set of (...) numbers satisfying “not odd but not not-prime”. The mistake is thinking that every two logically-equivalent false universal propositions have the same counterexamples. Only false universal propositions have counterexamples. A counterexample for “every two logically-equivalent false universal propositions have the same counterexamples” is two logically-equivalent false universal propositions not having the same counterexamples. The following counterexample arose naturally in my sophomore deductive logic course in a discussion of inner and outer converses. “Every even number precedes every odd number” is counterexemplified only by even numbers, whereas its equivalent “Every odd number is preceded by every even number” is counterexemplified only by odd numbers. Please let me know if you see this mistake in print. Also let me know if you have seen these points discussed before. I learned them in my own course: talk about learning by teaching! (shrink)

This paper presents a formalization of the classical proof of completeness in Henkin-style developed by Troelstra and van Dalen for intuitionistic logic with respect to Kripke models. The completeness proof incorporates their insights in a fresh and elegant manner that is better suited for mechanization. We discuss details of our implementation in the Lean theorem prover with emphasis on the prime extension lemma and construction of the canonical model. Our implementation is restricted to a system of intuitionistic propositional logic (...) with implication, conjunction, disjunction, and falsity given in terms of a Hilbert-style axiomatization. As far as we know, our implementation is the first verified Henkin-style proof of completeness for intuitionistic logic following Troelstra and van Dalen's method in the literature. (shrink)

Darwiche and Pearl’s seminal 1997 article outlined a number of baseline principles for a logic of iterated belief revision. These principles, the DP postulates, have been supplemented in a number of alternative ways. Most suggestions have resulted in a form of ‘reductionism’ that identifies belief states with orderings of worlds. However, this position has recently been criticised as being unacceptably strong. Other proposals, such as the popular principle (P), aka ‘Independence’, characteristic of ‘admissible’ operators, remain commendably more modest. In this (...) paper, we supplement the DP postulates and (P) with a number of novel conditions. While the DP postulates constrain the relation between a prior and a posterior conditional belief set, our new principles notably govern the relation between two posterior conditional belief sets obtained from a common prior by different revisions. We show that operators from the resulting family, which subsumes both lexicographic and restrained revision, can be represented as relating belief states associated with a ‘proper ordinal interval’ (POI) assignment, a structure more fine-grained than a simple ordering of worlds. We close the paper by noting that these operators satisfy iterated versions of many AGM era postulates, including Superexpansion, that are not sound for admissible operators in general. (shrink)

In this work we answer a long standing request for temporal embeddings of deontic STIT logics by introducing the multi-agent STIT logic TDS . The logic is based upon atemporal utilitarian STIT logic. Yet, the logic presented here will be neutral: instead of committing ourselves to utilitarian theories, we prove the logic TDS sound and complete with respect to relational frames not employing any utilitarian function. We demonstrate how these neutral frames can be transformed into utilitarian temporal (...) frames, while preserving validity. Last, we discuss problems that arise from employing binary utility functions in a temporal setting. (shrink)

In this paper we compare the propositional logic of Frege’s Grundgesetze der Arithmetik to modern propositional systems, and show that Frege does not have a separable propositional logic, definable in terms of primitives of Grundgesetze, that corresponds to modern formulations of the logic of “not”, “and”, “or”, and “if…then…”. Along the way we prove a number of novel results about the system of propositional logic found in Grundgesetze, and the broader system obtained by including identity. In (...) particular, we show that the propositional connectives that are definable in terms of Frege’s horizontal, negation, and conditional are exactly the connectives that fuse with the horizontal, and we show that the logical operators that are definable in terms of the horizontal, negation, the conditional, and identity are exactly the operators that are invariant with respect to permutations on the domain that leave the truth-values fixed. We conclude with some general observations regarding how Frege understood his logic, and how this understanding differs from modern views. (shrink)

Proposition are the material of our reasoning. Proposition are the basic building blocks of the world/thought. Proposition have intense relation with the world. World is a series of atomic facts and these facts are valued by the proposition although sentences explain the world of reality but can’t have any truth values, only proposition have truth values to describe the world in terms of assertions. Propositions are truth value bearers, the only quality of proposition is truth & falsity, that they are (...) either true or false. Proposition mirrors the world and explains how world is arranged in an orderly manner. It scans the world(object) and are composed of atomic facts experienced and can be analyzed into propositions. Propositions are the basic units of logic. The truth (affirm) and falsity (nego) are the qualities of the propositions and universality (generality) and Particularity are the quantities of the propositions. There are propositions which are neither true nor false, they are called Pseudo-Propositions and their quality are ipso-facto i.e meaningless. Propositions are used in computers with the modifications brought by the modern logicians in the form of statements or logical sentences. The truth table of the logical gates and binary operations (1,s or 0,s are due to the revolution of the modern logic or mathematical logic. It is a fact that proposition cannot change the word but it shows the relation between the object and of the word. Objectives: The objectives of this research is to explore the importance and need of propositions in logic. It also shows the analysis of propositions and how a philosopher thoughts in terms of propositions or concepts. In this research problem it is shown that propositions had been described in many ways by most of the philosophers and logicians from Aristotle to contemporary philosophers. It also analysis the contribution of the philosophers towards proposition and its relation to the world of reality. This research also describes the definition and nature of proposition. (shrink)

Scroggs's theorem on the extensions of S5 is an early landmark in the modern mathematical studies of modal logics. From it, we know that the lattice of normal extensions of S5 is isomorphic to the inverse order of the natural numbers with infinity and that all extensions of S5 are in fact normal. In this paper, we consider extending Scroggs's theorem to modal logics with propositional quantifiers governed by the axioms and rules analogous to the usual ones (...) for ordinary quantifiers. We call them Π-logics. Taking S5Π, the smallest normal Π-logic extending S5, as the natural counterpart to S5 in Scroggs's theorem, we show that all normal Π-logics extending S5Π are complete with respect to their complete simple S5 algebras, that they form a lattice that is isomorphic to the lattice of the open sets of the disjoint union of two copies of the one-point compactification of N, that they have arbitrarily high Turing-degrees, and that there are non-normal Π-logics extending S5Π. (shrink)