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)

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 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)

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)

A scheme to help merge the ideas of quantum gravity.

We propose a generalization of Sahlqvist formulas to polyadic modal languages by representing such languages in a combinatorial PDL style and thus, in particular, developing what we believe to be the right syntactic approach to Sahlqvist formulas at all. The class of polyadic Sahlqvist formulas PSF defined here expands essentially the so far known one. We prove first-order definability and canonicity for the class PSF.

What is the ontology of formal languages? What actually *are* well-formed formulas such as 'Fx' or 'p'? This issue has not been squarely addressed in the literature, still less has it been resolved. The paper does four things. First, it describes the standard view that formulas are symbol types. Second, it shows that the standard view is untenable. Third, it puts forward an alternative, structuralist view. Finally, it considers what, if anything, changes when we move from the standard (...) to the structuralist view of the ontology of formal languages. (shrink)

By formalizing some classical facts about provably total functions of intuitionistic primitive recursive arithmetic (iPRA), we prove that the set of decidable formulas of iPRA and of iΣ1+ (intuitionistic Σ1-induction in the language of PRA) coincides with the set of its provably ∆1-formulas and coincides with the set of its provably atomic formulas. By the same methods, we shall give another proof of a theorem of Marković and De Jongh: the decidable formulas of HA are its (...) provably ∆1-formulas. (shrink)

We propose a generalization of Sahlqvist formulae to polyadic modal languages by representing modal polyadic languages in a combinatorial style and thus, in particular, developing what we believe to be the right approach to Sahlqvist formulae at all. The class of polyadic Sahlqvist formulae PSF defined here expands essentially the so far known one. We prove first-order definability and canonicity for the class PSF.

A concept is traditionally defined via the necessary and sufficient conditions that clearly determine its extension. By contrast, cognitive views of concepts intend to account for empirical data that show that categorisation under a concept presents typicality effects and a certain degree of indeterminacy. We propose a formal language to compactly represent concepts by leveraging on weighted logical formulas. In this way, we can model the possible synergies among the qualities that are relevant for categorising an object under a (...) concept. We show that our proposal can account for a number of views of concepts such as the prototype theory and the exemplar theory. Moreover, we show how the proposed model can overcome some limitations of cognitive views. (shrink)

This paper presents an attempt to bridge the gap between logical and cognitive treatments of strategic reasoning in games. There have been extensive formal debates about the merits of the principle of backward induction among game theorists and logicians. Experimental economists and psychologists have shown that human subjects, perhaps due to their bounded resources, do not always follow the backward induction strategy, leading to unexpected outcomes. Recently, based on an eye-tracking study, it has turned out that even human subjects who (...) produce the outwardly correct ‘backward induction answer’ use a different internal reasoning strategy to achieve it. The paper presents a formal language to represent different strategies on a finer-grained level than was possible before. The language and its semantics help to precisely distinguish different cognitive reasoning strategies, that can then be tested on the basis of computational cognitive models and experiments with human subjects. The syntactic framework of the formal system provides a generic way of constructing computational cognitive models of the participants of the Marble Drop game. (shrink)

This paper describes a decision procedure for disjunctions of conjunctions of anti-prenex normal forms of pure first-order logic (FOLDNFs) that do not contain V within the scope of quantifiers. The disjuncts of these FOLDNFs are equivalent to prenex normal forms whose quantifier-free parts are conjunctions of atomic and negated atomic formulae (= Herbrand formulae). In contrast to the usual algorithms for Herbrand formulae, neither skolemization nor unification algorithms with function symbols are applied. Instead, a procedure is described that rests on (...) nothing but equivalence transformations within pure first-order logic (FOL). This procedure involves the application of a calculus for negative normal forms (the NNF-calculus) with A -||- A & A (= &I) as the sole rule that increases the complexity of given FOLDNFs. The described algorithm illustrates how, in the case of Herbrand formulae, decision problems can be solved through a systematic search for proofs that reduce the number of applications of the rule &I to a minimum in the NNF-calculus. In the case of Herbrand formulae, it is even possible to entirely abstain from applying &I. Finally, it is shown how the described procedure can be used within an optimized general search for proofs of contradiction and what kind of questions arise for a &I-minimal proof strategy in the case of a general search for proofs of contradiction. (shrink)

In his debut book, The Birth of Tragedy, Nietzsche presents what he understands as a metaphysics of art or metaphysics of the artist. As it becomes clear throughout the argument developed in the work, his aim is to favor a justification of the world and of existence as an aesthetic phenomenon. The path to his metaphysics passes through the interaction with Kantian and, mostly, Schopenhauerian formulations, and through a deep dialogue with Greek culture in general and, indirectly, with Pre-Socratic thought. (...) The objective of this article is to delimit the retentions and displacements of the critical tradition in his book from 1872, and highlight the importance of the interlocution with the Greek cultural repertoire in the conformation of his metaphysics of the artist. In particular, the working hypothesis is that Nietzsche, in these approaches and appropriations of critical and archaic philosophical tradition, finds the possibility of an immanent metaphysics in the post-Kantian context, conceived as a physiology (in the antique sense) of aesthetic bias. (shrink)

In his book Modal Logic as Metaphysics, Timothy Williamson defends first-order necessitism using simplicity as a powerful argument. However, simplicity is decomposed into two different, even antagonistic, sides: elegance and parsimony. On the one hand, elegance is the property of theories possessing few and simple principles that allow them to deploy all their theoretical power; on the other hand, parsimony is the property of theories having the fair and necessary number of ontological entities that allow such theories give an account (...) of themselves. Since necessitism endorses Barcan Formulae for the sake of elegance, it is committed to a vast number of contingently non-concrete objects, so one may think that it is not qualitatively parsimonious. I argue that necessitism could be viewed as an additive case in the sense that Alan Baker characterizes the adjective so quantitative parsimony should be considered when it comes to necessitism instead of qualitative parsimony. (shrink)

Paraconsistent logics are logical systems that reject the classical principle, usually dubbed Explosion, that a contradiction implies everything. However, the received view about paraconsistency focuses only the inferential version of Explosion, which is concerned with formulae, thereby overlooking other possible accounts. In this paper, we propose to focus, additionally, on a meta-inferential version of Explosion, i.e. which is concerned with inferences or sequents. In doing so, we will offer a new characterization of paraconsistency by means of which a logic is (...) paraconsistent if it invalidates either the inferential or the meta-inferential notion of Explosion. We show the non-triviality of this criterion by discussing a number of logics. On the one hand, logics which validate and invalidate both versions of Explosion, such as classical logic and Asenjo–Priest’s 3-valued logic LP. On the other hand, logics which validate one version of Explosion but not the other, such as the substructural logics TS and ST, introduced by Malinowski and Cobreros, Egré, Ripley and van Rooij, which are obtained via Malinowski’s and Frankowski’s q- and p-matrices, respectively. (shrink)

In this article, we will present a number of technical results concerning Classical Logic, ST and related systems. Our main contribution consists in offering a novel identity criterion for logics in general and, therefore, for Classical Logic. In particular, we will firstly generalize the ST phenomenon, thereby obtaining a recursively defined hierarchy of strict-tolerant systems. Secondly, we will prove that the logics in this hierarchy are progressively more classical, although not entirely classical. We will claim that a logic is to (...) be identified with an infinite sequence of consequence relations holding between increasingly complex relata: formulae, inferences, metainferences, and so on. As a result, the present proposal allows not only to differentiate Classical Logic from ST, but also from other systems sharing with it their valid metainferences. Finally, we show how these results have interesting consequences for some topics in the philosophical logic literature, among them for the debate around Logical Pluralism. The reason being that the discussion concerning this topic is usually carried out employing a rivalry criterion for logics that will need to be modified in light of the present investigation, according to which two logics can be non-identical even if they share the same valid inferences. (shrink)

We present epistemic multilateral logic, a general logical framework for reasoning involving epistemic modality. Standard bilateral systems use propositional formulae marked with signs for assertion and rejection. Epistemic multilateral logic extends standard bilateral systems with a sign for the speech act of weak assertion (Incurvati and Schlöder 2019) and an operator for epistemic modality. We prove that epistemic multilateral logic is sound and complete with respect to the modal logic S5 modulo an appropriate translation. The logical framework developed provides the (...) basis for a novel, proof-theoretic approach to the study of epistemic modality. To demonstrate the fruitfulness of the approach, we show how the framework allows us to reconcile classical logic with the contradictoriness of so-called Yalcin sentences and to distinguish between various inference patterns on the basis of the epistemic properties they preserve. (shrink)

We introduce a framework that allows for the construction of sequent systems for expressive description logics extending ALC. Our framework not only covers a wide array of common description logics, but also allows for sequent systems to be obtained for extensions of description logics with special formulae that we call "role relational axioms." All sequent systems are sound, complete, and possess favorable properties such as height-preserving admissibility of common structural rules and height-preserving invertibility of rules.

In this paper we discuss the extent to which the very existence of substructural logics puts the Tarskian conception of logical systems in jeopardy. In order to do this, we highlight the importance of the presence of different levels of entailment in a given logic, looking not only at inferences between collections of formulae but also at inferences between collections of inferences—and more. We discuss appropriate refinements or modifications of the usual Tarskian identity criterion for logical systems, and propose an (...) alternative of our own. After that, we consider a number of objections to our account and evaluate a substantially different approach to the same problem. (shrink)

The nature of sustainable monetary agency is explained in short formulae.

The depth-bounded approach seeks to provide realistic models of reasoners. Recognizing that most useful logics are idealizations in that they are either undecidable or likely to be intractable, the approach accounts for how they can be approximated in practice by resource-bounded agents. The approach has been applied to Classical Propositional Logic (CPL), yielding a hierarchy of tractable depth-bounded approximations to that logic, which in turn has been based on a KE/KI system. -/- This Thesis shows that the approach can be (...) naturally extended to useful nonclassical logics such as First-Degree Entailment (FDE), the Logic of Paradox (LP), Strong Kleene Logic (K3 ) and Intuitionistic Propositional Logic (IPL). To do this, we introduce a KE/KI-style system for each of those logics such that: is formulated via signed formulae, consist of linear operational rules and branching structural rule(s), can be used as a direct-proof and a refutation method, and is interesting independently of the approach in that it has an exponential speed-up on its tableau system counterpart. The latter given that we introduce a new class of examples which we prove to be hard for all tableau systems sharing the V/& rules with the classical one, but easy for their analogous KE-style systems. Then we focus on showing that each of our KE/KI-style systems naturally yields a hierarchy of tractable depth-bounded approximations to the respective logic, in terms of the maximum number of allowed nested applications of the branching rule(s). The rule(s) express(es) a generalized rule of bivalence, is (are) essentially cut rule(s) and govern(s) the manipulation of virtual information, which is information that an agent does not hold but she temporarily assumes as if she held it. Intuitively, the more virtual information needs to be invoked via the branching rule(s), the harder the inference is for the agent. So, the nested application the branching rule(s) provides a sensible measure of inferential depth. We also show that each hierarchy approximating FDE, LP, and K3 , admits of a 5-valued non-deterministic semantics; whereas, paving the way for a semantical characterization of the hierarchy approximating IPL, we provide a 3-valued non-deterministic semantics for the full logic that fixes the meaning of the connectives without appealing to “structural” conditions. -/- Moreover, we show a super-polynomial lower bound for the strongest possible version of clausal tableaux on the well-known class of “truly fat” expressions (which are easy for KE), settling a problem left open in the literature. Further, we investigate a hierarchy of tractable depth-bounded approximations to CPL based only on KE. Finally, we propose a refinement of the p-simulation relation which is adequate to establish positive results about the superiority of a system over another with respect to proof-search. (shrink)

In his essay, “Intentionality and Physiological Processes,” Richard Sorabji claims that Aristotle maintains a sharp distinction between the formal and material causes of sensation.1 To that end, Sorabji interprets a cluster of Aristotelian formulae about sensation as descriptions that exclusively pertain to perception's material cause. This material cause, according to Sorabji, is the process that the sense organ undergoes during an episode of sensation. These Aristotelian formulae fall roughly into three main groups: the claim that what perceives receives form (which (...) I will call the formal reception thesis), the claim that what perceives receives form without matter (which I will call the anahylic reception thesis2), and the claim that what perceives becomes actually like or such as its object from being potentially like or such (which I will call the likeness thesis). According to Sorabji, when Aristotle asserts any of these three theses, he is referring to one and the same physiological process by which the organ becomes actually and literally black or white, hot or cold, dry or fluid. In this paper, I show that this is not the case, because on a careful reading of _De Anima_ III. 4, _nous_ or mind is also receptive of form without matter for Aristotle, and that this, in fact, is essential for his arguments' success in this chapter. (shrink)

We employ a recently developed methodology -- called "structural refinement" -- to extract nested sequent systems for a sizable class of intuitionistic modal logics from their respective labelled sequent systems. This method can be seen as a means by which labelled sequent systems can be transformed into nested sequent systems through the introduction of propagation rules and the elimination of structural rules, followed by a notational translation. The nested systems we obtain incorporate propagation rules that are parameterized with formal grammars, (...) and which encode certain frame conditions expressible as first-order Horn formulae that correspond to a subclass of the Scott-Lemmon axioms. We show that our nested systems are sound, cut-free complete, and admit hp-admissibility of typical structural rules. (shrink)

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)

We investigate an enrichment of the propositional modal language L with a "universal" modality ■ having semantics x ⊧ ■φ iff ∀y(y ⊧ φ), and a countable set of "names" - a special kind of propositional variables ranging over singleton sets of worlds. The obtained language ℒ $_{c}$ proves to have a great expressive power. It is equivalent with respect to modal definability to another enrichment ℒ(⍯) of ℒ, where ⍯ is an additional modality with the semantics x ⊧ ⍯φ (...) iff Vy(y ≠ x → y ⊧ φ). Model-theoretic characterizations of modal definability in these languages are obtained. Further we consider deductive systems in ℒ $_{c}$ . Strong completeness of the normal ℒ $_{c}$ logics is proved with respect to models in which all worlds are named. Every ℒ $_{c}$ -logic axiomatized by formulae containing only names (but not propositional variables) is proved to be strongly frame-complete. Problems concerning transfer of properties ([in]completeness, filtration, finite model property etc.) from ℒ to ℒ $_{c}$ are discussed. Finally, further perspectives for names in multimodal environment are briefly sketched. (shrink)

FDE, LP and K3 are closely related to each other and admit of an intuitive informational interpretation. However, all these logics are co-NP complete, and so idealized models of how an agent can think. We address this issue by shifting to signed formulae, where the signs express imprecise values associated with two bipartitions of the corresponding set of standard values. We present proof systems whose operational rules are all linear and have only two structural branching rules that express a generalized (...) Principle of Bivalence. Each of these systems leads to defining an infinite hierarchy of tractable approximations to the respective logic, in terms of the maximum number of allowed nested applications of the two branching rules. Further, each resulting hierarchy admits of an intuitive 5-valued non-deterministic semantics. (shrink)

We develop a conceptually clear, intuitive, and feasible decision procedure for testing satisfiability in the full multi\-agent epistemic logic \CMAELCD\ with operators for common and distributed knowledge for all coalitions of agents mentioned in the language. To that end, we introduce Hintikka structures for \CMAELCD\ and prove that satisfiability in such structures is equivalent to satisfiability in standard models. Using that result, we design an incremental tableau-building procedure that eventually constructs a satisfying Hintikka structure for every satisfiable input set of (...) formulae of \CMAELCD\ and closes for every unsatisfiable input set of formulae. (shrink)

FDE is a logic that captures relevant entailment between implication-free formulae and admits of an intuitive informational interpretation as a 4-valued logic in which “a computer should think”. However, the logic is co-NP complete, and so an idealized model of how an agent can think. We address this issue by shifting to signed formulae where the signs express imprecise values associated with two distinct bipartitions of the set of standard 4 values. Thus, we present a proof system which consists of (...) linear operational rules and only two branching structural rules, the latter expressing a generalized rule of bivalence. This system naturally leads to defining an infinite hierarchy of tractable depth-bounded approximations to FDE. Namely, approximations in which the number of nested applications of the two branching rules is bounded. (shrink)

It is argued that medical science requires a classificatory system that (a) puts functions in the taxonomic center and (b) does justice ontologically to the difference between the processes which are the realizations of functions and the objects which are their bearers. We propose formulae for constructing such a system and describe some of its benefits. The arguments are general enough to be of interest to all the life sciences.

By a numerical formula, we shall understand an equation, m = n, between closed numerical terms, m and n. Assuming with Frege that numerical formulae, when true, are demonstrable, the main question to be considered here is what form such a demonstration takes. On our way to answering the question, we are led to more general questions regarding the proper formalization of arithmetic. In particular, we shall deal with calculation, definition, identity, and inference by induction.

Standpoint logic is a recently proposed formalism in the context of knowledge integration, which advocates a multi-perspective approach permitting reasoning with a selection of diverse and possibly conflicting standpoints rather than forcing their unification. In this paper, we introduce nested sequent calculi for propositional standpoint logics---proof systems that manipulate trees whose nodes are multisets of formulae---and show how to automate standpoint reasoning by means of non-deterministic proof-search algorithms. To obtain worst-case complexity-optimal proof-search, we introduce a novel technique in the context (...) of nested sequents, referred to as "coloring," which consists of taking a formula as input, guessing a certain coloring of its subformulae, and then running proof-search in a nested sequent calculus on the colored input. Our technique lets us decide the validity of standpoint formulae in CoNP since proof-search only produces a partial proof relative to each permitted coloring of the input. We show how all partial proofs can be fused together to construct a complete proof when the input is valid, and how certain partial proofs can be transformed into a counter-model when the input is invalid. These "certificates" (i.e. proofs and counter-models) serve as explanations of the (in)validity of the input. (shrink)

We give a complete axiomatization of the identities of the basic game algebra valid with respect to the abstract game board semantics. We also show that the additional conditions of termination and determinacy of game boards do not introduce new valid identities.En route we introduce a simple translation of game terms into plain modal logic and thus translate, while preserving validity both ways, game identities into modal formulae.The completeness proof is based on reduction of game terms to a certain ‘minimal (...) canonical form’, by using only the axiomatic identities, and on showing that the equivalence of two minimal canonical terms can be established from these identities. (shrink)

Every truth function corresponds to an isomorphic digital circuit. Consequently, the logical structure of every proposition can be presented within the range of propositional logic as an equivalent digital circuit. Provided that the logical values "true" and "false" correspond to the "high" and "low" voltage levels, the output of a circuit being equivalent with contradiction is always low level for every input state, whereas the output of a circuit corresponding to a tautology is always high level, irrespective of the input (...) states. On the other hand, the remaining propositions correspond to circuits whose output is high-level if and only if certain atomic components of the proposition are true, and the rest of the atomic components are false. The inputs equivalent to the atomic propositions are either high or low level. However, what logical circuits are equivalent to a circulating statement or argumentation? -/- The propositions are true or false irrespective of time, whereas the voltage level of the circuits can change over time. To be more precise, we can say that the input levels of the circuits are high or low depending on whether we evaluate the atomic formulae of the formula expressing the logical structure of the proposition as true or false. The voltage level of the output of the circuit corresponds to the truth value of the formula. I will call `{combinational automaton}' the digital circuit that may model the formulae of propositional logic. -/- Formulae connected with truth functions yield formulae again. Although there are always corresponding automata for them, the situation is not simple in this case. We do not always get combined automata joined to each other, and in some cases, it is also possible that we do not get an automaton--an operating machine or circuit--at all. -/- There are digital circuits whose output is not a function of their input. The range of automata is wider than that of combinational automata. It includes machines whose input states do not unambiguously determine the output states; that is, the output is not a function of the input. This is because the circuit has feedback. Most digital circuits belong to this latter group. I will call them "sequential automata". -/- The question arises whether there is a logical structure of a circulating statement that corresponds to such a sequential automaton (or sequential circuit). In my view, the logical structure of the Liar Paradox coincides with the operation of a sequential automaton irrespective of the logical correctness of the paradox itself. The analysis also examines possibilities for further developing the model. (shrink)

Complete deductive systems are constructed for the non-valid (refutable) formulae and sequents of some propositional modal logics. Thus, complete syntactic characterizations in the sense of Lukasiewicz are established for these logics and, in particular, purely syntactic decision procedures for them are obtained. The paper also contains some historical remarks and a general discussion on refutation systems.

Raymond Carver's stories have received many labels: minimalism, K-mart fiction, low-rent tragedy, neo-realism. Paring language, plot, and characterization to the bone, Carver concentrates his stories on instances of judgment and choice. These climactic moments affect not only the characters, but also the reader, who is called to fill the gaps in the text. The gaps generally show the unrelatedness of the characters' responses to the situations in which they find themselves. Relying on formulae, concepts, and rules taken for granted as (...) common knowledge, Carver's characters make choices and judgments which reveal the displacement of their consciousness of themselves and of the world. In trying to fill the gaps, the reader finds himself/herself in the same stance of making judgments and choices, and of looking at his/her own displacement. This predicament is more poignantly conveyed in the early stories, collected in Will You Please Be Quiet, Please?, Furious Seasons, and What We Talk About When We Talk About Love, since Carver writes about people "on the other side of the tracks," that is, on the edges of the sites of power and decisions. Bartenders, wage workers, and salespeople, Carver's characters in these early stories see their lives always threatened by joblessness, bankruptcy, and homelessness. In the later stories, collected in Cathedral and Where I'm Calling From, Carver explores possibilities in conversation, storytelling, and rituals that celebrate the here and now of each occasion and allow the merging of voices and feelings that places the individual's consciousness in the world. (shrink)

In the paper, it is investigated whether for real argument s the (s − 1)n+1 weighted Riemann zeta function ζ(n)(s) limits s ↓ 1 do exist. Here we will look only at n =0,1. The answer to the question could very well be that assuming existence of limits to be true gives a conflicting outcome. This result may support the possibility of what can be called incompleteness in concrete mathematics. Interestingly, the uncovered incompleteness occurs in an approximation-theoretical framework. The key (...) argument we employ in the paper revolves around the approximation of a l’H ˆopital limit. Only an “after the fact” alternative approach reorders the formulae in the derivation. This reordering is, in fact, based on a 0=1contradiction as starting point. However,the alternative 0=1based approach is not the limit approximation that is used in the flow of the derivation in the present paper. (shrink)

In this article, we provide three generators of propositional formulae for arbitrary languages, which uniformly sample three different formulae spaces. They take the same three parameters as input, namely, a desired depth, a set of atomics and a set of logical constants (with specified arities). The first generator returns formulae of exactly the given depth, using all or some of the propositional letters. The second does the same but samples up-to the given depth. The third generator outputs formulae with exactly (...) the desired depth and all the atomics in the set. To make the generators uniform (i.e. to make them return every formula in their space with the same probability), we will prove various cardinality results about those spaces. (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)

In the paper we examine the method of axiomatic rejection used to describe the set of nonvalid formulae of Aristotle's syllogistic. First we show that the condition which the system of syllogistic has to fulfil to be ompletely axiomatised, is identical to the condition for any first order theory to be used as a logic program. Than we study the connection between models used or refutation in a first order theory and rejected axioms for that theory. We show that any (...) formula of syllogistic enriched with classical connectives is decidable using models in the domain with three members. (shrink)

Building upon the works of Gödel, Zalta ; and Benzmüller and Paleo, this paper introduces a formal system and testable system for Metaphysical Cosmology, referring to the study of the nature of existence, non-existence, and their interplay. The aim is to integrate metaphysics into a testable scientific framework, beyond speculative reasoning. The system abides by three principles which serve as a foundation for implementing a scientific methodology in metaphysics: (i) axioms must be minimized, incorporating Cartesian-like skepticism ; (ii) theorems must (...) be inferred through proof-theoretic derivations ; (iii) theorems must be tested experimentally through computation. The system borrows from type-theoretic concepts and introduces new logical notions as tools for Metaphysical Cosmology, such as a metric-space-based predicate system, and a revised version of the existential quantifier. These tools offer an exhaustive approach to metaphysical entities and provide mechanisms to address contradictions. Formulae and equations depicting the structure of the Metaphysical Cosmos are inferred from the system through proof-theoretic derivations. Theorems inferred from the system have been tested using the theorem-prover Z3, encoded in Python, which determines whether a formula is satisfiable. While testing a theorem, its negation is inputted in Z3, and if the output displays that its negation is satisfiable, then the theorem is falsified and rejected, otherwise it is accepted as valid. This method thus follows the falsifiability criteria, as per Karl Popper, reinforcing testable scientific methodology in metaphysics. The code used in computational experimentation is given in full in the appendix for reproducibility. (shrink)

Carnap’s result about classical proof-theories not ruling out non-normal valuations of propositional logic formulae has seen renewed philosophical interest in recent years. In this note I contribute some considerations which may be helpful in its philosophical assessment. I suggest a vantage point from which to see the way in which classical proof-theories do, at least to a considerable extent, encode the meanings of the connectives (not by determining a range of admissible valuations, but in their own way), and I demonstrate (...) a kind of converse to Carnap’s result. (shrink)

While Classical Logic (CL) used to be the gold standard for evaluating the rationality of human reasoning, certain non-theorems of CL—like Aristotle’s and Boethius’ theses—appear intuitively rational and plausible. Connexive logics have been developed to capture the underlying intuition that conditionals whose antecedents contradict their consequents, should be false. We present results of two experiments (total n = 72), the first to investigate connexive principles and related formulae systematically. Our data suggest that connexive logics provide more plausible rationality frameworks for (...) human reasoning compared to CL. Moreover, we experimentally investigate two approaches for validating connexive principles within the framework of coherence-based probability logic (Pfeifer & Sanfilippo, 2021). Overall, we observed good agreement between our predictions and the data, but especially for Approach 2. (shrink)

In the chapter “Information and Content” of their Impossible Worlds, Berto and Jago provide us with a semantic account of information in deductive reasoning such that we have an explanation for why some, but not all, logical deductions are informative. The framework Berto and Jago choose to make sense of the above-mentioned idea is a semantic interpretation of Sequent Calculus rules of inference for classical logic. I shall argue that although Berto and Jago’s idea and framework are hopeful, their definitions (...) do not capture what is intended. This is so because the definitions are solely based on the logical complexity of an argument and they fail to capture the richness of the non- logical content of that argument. Then I will suggest some amendments to address this problem. Finally, I will extend the application of the definitions to first-order logic. It shall be observed that in some classical deductions, applying contraction may lead to hiding some epistemic impossibilities. This happens when formulae which contribute different propositions to the proof get contracted at the quantified level. (shrink)

This is a contribution to the idea that some proofs in first-order logic are synthetic. Syntheticity is understood here in its classical geometrical sense. Starting from Jaakko Hintikka’s original idea and Allen Hazen’s insights, this paper develops a method to define the ‘graphical form’ of formulae in monadic and dyadic fraction of first-order logic. Then a synthetic inferential step in Natural Deduction is defined. A proof is defined as synthetic if it includes at least one synthetic inferential step. Finally, it (...) will be shown that the proposed definition is not sensitive to different ways of driving the same conclusion from the same assumptions. (shrink)

Abstract We examine the construction of electromagnetism in its current form, and in an alternative form, from a point of view that combines a minimal realism with strict rational demands. We begin by discussing the requests of reason when constructing a theory and next, we follow the historical development as presented in the record of original publications, the underlying epistemology (often explained by the authors) and the mathematical constructions. The historical construction develops along socio-political disputes (mainly, the reunification of Germany (...) and the second industrial revolution), epistemic disputes (at least two demarcations of science in conflict) and several theories of electromagnetism. Such disputes resulted in the militant adoption of the ether by some, a position that expanded in parallel with the expansion of Prussia. This way of thinking was facilitated by the earlier adoption of a standpoint that required, as a condition for understanding, the use of physical hypothesis in the form of analogies; an attitude that is antithetic to Newton's “hypotheses non fingo”. While the material ether was finally abandoned, the epistemology survived in the form of “substantialism” and a metaphysical ether: the space. The militants of the ether attributed certainties regarding the ether to Faraday and Maxwell, when they only expressed doubts and curiosity. Thus, the official story is not the real history. This was achieved by the operation of detaching Maxwell's electromagnetism from its construction and introducing a new game of formulae and interpretations. Large and important parts of Maxwell work are today not known, as for example, the rules for the transformation of the electromagnetic potentials between moving systems. When experiments showed that all the theories based in the material ether were incorrect, a new interpretation was offered: Special Relativity (SR). At the end of the transformation period a pragmatic view of science, well adapted to the industrial society, had emerged, as well as a new protagonist: the theoretical physicist. The rival theory of delayed action at distance initiated under the influence of Gauss was forgotten in the midst of the intellectual warfare. The theory is indistinguishable in formulae from Maxwell's and its earlier versions are the departing point of Maxwell for the construction of his equations. We show in a mathematical appendix that such (relational) theory can incorporate Lorentz' contributions as well as Maxwell's transformations and C. Neumann's action, without resource to the ether. Demarcation criteria was further changed at the end of the period making room for habits and intuitions. When these intuited criteria are examined by critical reason (seeking for the fundaments) they can be sharpened with the use of the Non Arbitrariness Principle, which throws light over the arbitrariness in the construction of SR. Under a fully rational view SR is not acceptable, it requires to adopt a less demanding epistemology that detaches the concept from the conception, such as Einstein's own view in this respect, inherited from Hertz. In conclusion: we have shown in this relevant exercise how the reality we accept depends on earlier, irrational, decisions that are not offered for examination but rather are inherited from the culture. (shrink)

This paper addresses the issues related to designing and estimating the strength of solid-alloy elements in the deforming broaches of significant diameter (exceeding 150 mm) for the developed process of discrete broaching. The tool limit condition was assessed based on two strength criteria: the specific potential energy of shape change and the maximum tangent stresses. Numerical modeling using the finite element method has made it possible to derive the distribution of equivalent stresses in the tool elements and the contact stresses (...) at the surface of the contact between a solid-alloy insert and the body, which enabled the analysis of tool strength under loading. The simulation was performed under a single normal load, which ensured the versatility of the calculation for any contact pressure values. We have derived formulae to calculate the acceptable contact pressure depending on unit load. The effect of the insert protrusion height over the body on the strength of tool elements has been established. We have derived engineering dependences that determine the required magnitude of insert protrusion over the body depending on the ultimate load. An example of calculating the strength of a prefabricated deforming element in the machining of a sleeve made from gray modified cast iron of hardness HB230 has been considered. Our calculations have shown that the deforming element designed for the new technological process corresponds to the conditions of strength, provided the ratio h1/h=0.15 is maintained (where h1 is the insert height above the body, h is the insert height). The results obtained could be used in engineering calculations when designing the prefabricated tool for discrete deformation, as well as to assess the strength of prefabricated tools, such as cutters, core drills, reamers, when refining external loads. (shrink)