Proof-theoretic semantics (P-tS) is the paradigm of semantics in which meaning in logic is based on proof (as opposed to truth). A particular instance of P-tS for intuitionistic propositional logic (IPL) is its base-extension semantics (B-eS). This semantics is given by a relation called support, explaining the meaning of the logical constants, which is parameterized by systems of rules called bases that provide the semantics of atomic propositions. In this paper, we interpret bases as collections of definite formulae and use (...) the operational view of them as provided by uniform proof-search—the proof-theoretic foundation of logic programming (LP)—to establish the completeness of IPL for the B-eS. This perspective allows negation, a subtle issue in P-tS, to be understood in terms of the negation-as-failure protocol in LP. Specifically, while the denial of a proposition is traditionally understood as the assertion of its negation, in B-eS we may understand the denial of a proposition as the failure to find a proof of it. In this way, assertion and denial are both prime concepts in P-tS. (shrink)

In terms of validity in Kripke frames, a modal formula expresses a universal monadic second-order condition. Those modal formulae which are equivalent to first-order conditions are called \emph{elementary}. Modal formulae which have a certain persistence property which implies their validity in all canonical frames of modal logics axiomatized with them, and therefore their completeness, are called \emph{canonical}. This is a survey of a recent and ongoing study of the class of elementary and canonical modal formulae. We summarize main ideas and (...) results, and outline further research perspectives. (shrink)

Isomorphism between formulae is defined with respect to categories formalizing equality of deductions in classical propositional logic and in the multiplicative fragment of classical linear propositional logic caught by proof nets. This equality is motivated by generality of deductions. Characterizations are given for pairs of isomorphic formulae, which lead to decision procedures for this isomorphism.

Kant's formulae ought to effectively produce the same result when applied to the moral validity of any particular maxim; further, no valid maxim produces contradictory results when applied against Kant's Universal Law and Humanity formulae. Where one uses all formulae in the assessment of a maxim, one gains a more complete understanding of the moral law, thereby bridging principles of reason with intuition within the agent who has undertaken to evaluate the morality of a particular action. These formulae command without (...) regard to any particular interests, but are instead unconditional; further, these formulae effectively limit choice of action and therefore give rise to duty. Kant implies that the structure of all maxims requires different formulae of the same moral law, i.e., all maxims have a ‘form’ and a ‘matter’, which prompt reconfiguring of the categorical imperative into different formulae in order to test the morality of a maxim. (shrink)

In this paper, we present a way to translate the metainferences of a mixed metainferential system into formulae of an extended-language system, called its associated σ-system. To do this, the σ-system will contain new operators (one for each standard), called the σ operators, which represent the notions of "belonging to a (given) standard". We first prove, in a model-theoretic way, that these translations preserve (in)validity. That is, that a metainference is valid in the base system if and only if its (...) translation is a tautology of its corresponding σ-system. We then use these results to obtain other key advantages. Most interestingly, we provide a recipe for building unlabeled sequent calculi for σ-systems. We then exemplify this with a σ-system useful for logics of the ST family, and prove soundness and completeness for it, which indirectly gives us a calculus for the metainferences of all those mixed systems. Finally, we respond to some possible objections and show how our σ-framework can shed light on the “obeying” discussion within mixed metainferential contexts. (shrink)

Ritualistic formulae and acts pervade the political, legal, societal and religious life of the ancient world. In many instances there are striking similarities between the formulae of the Greco-Roman world and those of the Near East. Often illumination exists from one to the other. Here I wish to notice a few passages in Greek drama where I think such illumination is possible.

Ancient Greek mathematics developed the original feature of being deductive mathematics. This article attempts to give a explanation f or this achievement. The focus is on the use of a fixed system of linguistic formulae in Greek mathematical texts. It is shown that the structure of this system was especially adapted for the easy computation of operations of substitution on such formulae, that is, of replacing one element in a fixed formula by another, and it is further argued that such (...) operations of substitution were the main logical tool required by Greek mathematical deduction. The conclusion explains why, assuming the validity of the description above, this historical level is the best explanatory level for the phenomenon of Greek mathematical deduction. (shrink)

Ritualistic formulae and acts pervade the political, legal, societal and religious life of the ancient world. In many instances there are striking similarities between the formulae of the Greco-Roman world and those of the Near East. Often illumination exists from one to the other. Here I wish to notice a few passages in Greek drama where I think such illumination is possible.

We generalize and extend the class of Sahlqvist formulae in arbitrary polyadic modal languages, to the class of so called inductive formulae. To introduce them we use a representation of modal polyadic languages in a combinatorial style and thus, in particular, develop what we believe to be a better syntactic approach to elementary canonical formulae altogether. By generalizing the method of minimal valuations à la Sahlqvist–van Benthem and the topological approach of Sambin and Vaccaro we prove that all inductive formulae (...) are elementary canonical and thus extend Sahlqvist’s theorem over them. In particular, we give a simple example of an inductive formula which is not frame-equivalent to any Sahlqvist formula. Then, after a deeper analysis of the inductive formulae as set-theoretic operators in descriptive and Kripke frames, we establish a somewhat stronger model-theoretic characterization of these formulae in terms of a suitable equivalence to syntactically simpler formulae in the extension of the language with reversive modalities. Lastly, we study and characterize the elementary canonical formulae in reversive languages with nominals, where the relevant notion of persistence is with respect to discrete frames. (shrink)

In terms of validity in Kripke frames, a modal formula expresses a universal monadic second-order condition. Those modal formulae which are equivalent to first-order conditions are called elementary. Modal formulae which have a certain persistence property which implies their validity in all canonical frames of modal logics axiomatized with them, and therefore their completeness, are called canonical. This is a survey of a recent and ongoing study of the class of elementary and canonical modal formulae. We summarize main ideas and (...) results, and outline further research perspectives. (shrink)

Another sort of thing resembles works of art in combining existence, message and a kind of presentation, namely, symbols. Hence it seems reasonable to take works of art as symbols. And yet works of art are a special kind of symbol, because in them presentation has a double function. All symbols directly present their meaning; indeed the essential function of symbols is to serve as vehicles for conveying us into the immediate presence of what they mean. But works of art (...) have a second presentational mode of functioning. They also present themselves; and this is true both for abstract and for representational art. (shrink)

There are several areas in applied logic where deletion from databases is involved in one way or another:Belief contraction Triggers of the form ‘If condition then remove A’, which are extensively used in database management systemsResource considerations as in relevance and linear logics, where addition or removal of resource can affect provabilityFree logic and the like, where existence and non-existence of individuals affects quantification.All of these areas have certain logical difficulties relating to the removal of elements. This paper points out (...) the difficulties and offers a comprehensive logical model. (shrink)

This article suggests a novel way to advance a current debate in the philosophy of mathematics. The debate concerns the role of diagrams and visual reasoning in proofs—which I take to concern the criteria of legitimate representation of mathematical thought. Drawing on the so-called ‘maverick’ approach to philosophy of mathematics, I turn to mathematical practice itself to adjudicate in this debate, and in particular to category theory, because there (a) diagrams obviously play a major role, and (b) category theory itself (...) addresses questions of representation and information preservation over mappings. We obtain a mathematical answer to a philosophical question: a good mathematical representation can be characterized as a category theoretic natural transformation. (shrink)

This paper is about several little-known Latin funerary formulae of some interest. It is also intended as an addition to the growing literature on what are now called in English ‘support verbs’, with special focus on facio.

This article is a study of formulaic passages in the Sanskrit Avadanasataka. Alongside a preliminary discussion of work on oral studies within Buddhism, and some recourse to wider oral studies on Indian texts, the focus of this article is a two-part study of formulae and constituents of formulae. The first part of the article details formulaic sections from the Avadanasataka, from short formulae about wealthy merchants to lengthy counterparts that detail the consequences of a Buddha's smile. The second part looks (...) in detail at constituents of the formulaic passages. The passages are constructed around semantic lists, which either constitute the whole formulaic phrase or passages, or can be identified as the building blocks for the passages. To my knowledge this is the first study of semantic list-based formulae in a Sanskrit text. (shrink)

Shows that a certain temporal logic has infinitely many non-equivalent formulae in a single variable.

The Lorentz-formulae are deduced from three factual statements the physical meaning of which is explained in terms of operations with clocks, light-signals and measuring rods. These statements are: (1) The time-length of a process is invariant. (2) The velocity of light is the same in all inertial systems. (3) The velocity of light is independent of the source. It is also shown that these statements can be deduced from the Lorentz-formulae. They are the physical content of the latter. The principle (...) of relativity and the light-principle together, however, contain more physical meaning than the Lorentz-formulae. Operational definitions are given for all relevant concepts. (shrink)

Let R be a real closed field, and X⊆Rm\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${X\subseteq R^m}$$\end{document} semi-algebraic and 1-dimensional. We consider complete first-order theories of modules over the ring of continuous semi-algebraic functions X→R\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${X\to R}$$\end{document} definable with parameters in R. As a tool we introduce -piecewise vector bundles on X and show that the category of piecewise vector bundles on X is equivalent to the category of syzygies of (...) finitely generated submodules of free modules. We give an explicit method to determine the Baur–Monk invariants of free modules in terms of pre-piecewise vector bundles. When R is a recursive real closed field this yields the decidability of the theory of free modules. Where it makes sense, we address the same questions for continuous definable functions in o-minimal expansions of a real closed field. From the free module case we are able to deduce generalisations of some results to arbitrary modules over the ring. We present a geometrically motivated quantifier elimination result down to the level of positive primitive formulae with a certain block decomposition of the matrix of coefficients. (shrink)

The most recent work dealing expressly with adoption in Greece is Wentzel's article in Hermes lxv, 167–76, ‘Studien über die Adoption in Griechen-land’. Her article ranges widely over the whole subject and includes a list of all the inscriptions known to her which refer to adoptions, as well as a list of the adoptive formulae found in these inscriptions. In the present article I shall deal more fully with these formulae.

— via appropriate substitutions — syntactically identical. The method can be applied directly to quantifierfree formulae and, in this paper, will b e extended in a natural and strai ghlforward way to quantified formulae.

The most recent work dealing expressly with adoption in Greece is Wentzel's article in Hermes lxv , 167–76, ‘Studien über die Adoption in Griechen-land’. Her article ranges widely over the whole subject and includes a list of all the inscriptions known to her which refer to adoptions, as well as a list of the adoptive formulae found in these inscriptions. In the present article I shall deal more fully with these formulae.

We elaborate on semantically labelled syntax trees that provide a method of proving the non-existence of modal formulae satisfying certain syntactic properties and defining a given class of frames and use them to show that there are classes of Kripke frames that are definable by both non-Sahlqvist and Sahlqvist formulae, but the latter requires more propositional variables.

The paper is intended to provide a full-scale defence of the infamous Barcan Formulae. Not only do I put forth some arguments, both semantic and metaphysical, against recent criticism; I also take pains at supplying some rationale in favour of the formal semantics underlying the Formulae, namely Possibilist quantification. Such a task is carried out through an argument for Compositional Nihilism, according to which nothing but mereological simples ever exists, and consequently through an informal sketch of the metaphysics of possible (...) worlds grounded upon Compositional Nihilism. The paper closes by surveying the main reasons why the account championed here isn’t defective with respect to other possibilist accounts of existence and modality presently on stage. (shrink)

The standard Hilbert-style of axiomatic system yields the assertion of axioms and, via the use of rules, the assertion of theorems. However, there has been little work done on the corresponding axiomatic rejection of non-theorems. Such Hilbert-style rejection would be achieved by the inclusion of certain rejection-axioms (r-axioms) and, by use of rejection-rules (r-rules), the establishment of rejection-theorems (r-theorems). We will call such a proof a rejection-proof (r-proof). The ideal to aim for would be for the theorems and r-theorems to (...) bemutually exclusive and exhaustive. That is, if a formula A is a theorem then it is not an r-theorem, and if A is a non-theorem then it is an r-theorem. In this paper, I present a rejecion system for the first-degree formulae of a large number of relevant logics. (shrink)

We show that a typed compositional theory of positive truth with internal induction for total formulae (denoted by PT tot ) is not semantically conservative over Peano arithmetic. In addition, we observe that the class of models of PA expandable to models of PT tot contains every recursively saturated model of arithmetic. Our results point to a gap in the philosophical project of describing the use of the truth predicate in model-theoretic contexts.

In [1], we established Gentzenizations for a good range of relevant logics with distribution, but, in the process, we added inversion rules, which involved extra structural connectives, and also added the sentential constantt. Instead of eliminating them, we used conservative extension results to relate them back to the original logics. In [4], we eliminated the inversion rules andtand established a much simpler Gentzenization for the weak sentential relevant logicDW, and also for its quantificational extensionDWQ, but a restriction to normal formulae (...) (defined below) was required to enable these results to be proved. This method was quite general and hope was expressed about extending it to other relevant logics.In this paper, we develop an innovative method, which makes essential use of this restriction to normality, to establish two simple Gentzenizations for the normal formulae of the slightly weaker logic B, and then extend the method to other sentential contraction-less logics. To obtain the first of these Gentzenizations, for the logicsBandDW, we remove the two branching rules (F&) and (T∨), together with the structural connective ‘,’, to simplify the elimination of the inversion rules andt. We then eliminate the rules (T&) and (F∨), thus reducing the Gentzen system to one containing only ˜ and → and their four associated rules, and reduce the remaining types of structures to four simple finite types. Subsequently, we re-introduce (T&) and (F∨), and also (F&) and (T∨), to obtain the second Gentzenization, which contains ‘,’ but no structural rules. (shrink)

The basis of the Periodic Table is discussed. Electronic configuration recurs in only 21 out of the 32 groups. A better basis is derived by considering the highest classical valency (v) exhibited by an element and a new measure, the highest valency in carbonyl compounds (v*). This leads to a table based on the number of outer electrons possessed by an atom (N) and the number of electrons required for it to achieve an inert (noble) gas configuration (N*). Periodicity of (...) these is nearly complete. The new basis helps to settle the question of the best form of table and related issues. (shrink)