We consider weak theories of concatenation, that is, theories for strings or texts. We prove that the theory of concatenation WTC-ε\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathsf{WTC}^{-\varepsilon}}$$\end{document}, which is a weak subtheory of Grzegorczyk’s theory TC-ε\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathsf{TC}^{-\varepsilon}}$$\end{document}, is a minimal essentially undecidable theory, that is, the theory WTC-ε\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathsf{WTC}^{-\varepsilon}}$$\end{document} is essentially undecidable and if one omits (...) an axiom scheme from WTC-ε\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathsf{WTC}^{-\varepsilon}}$$\end{document}, then the resulting theory is no longer essentially undecidable. Moreover, we give a positive answer to Grzegorczyk and Zdanowski’s conjecture that ‘The theory TC-ε\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathsf{TC}^{-\varepsilon}}$$\end{document} is a minimal essentially undecidable theory’. For the alternative theories WTC\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathsf{WTC}}$$\end{document} and TC\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathsf{TC}}$$\end{document} which have the empty string, we also prove that the each theory without the neutrality of ε\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\varepsilon}$$\end{document} is to be such a theory too. (shrink)

A general method of interpreting weak higher-type theories of nonstandard arithmetic in their standard counterparts is presented. In particular, this provides natural nonstandard conservative extensions of primitive recursive arithmetic, elementary recursive arithmetic, and polynomial-time computable arithmetic. A means of formalizing basic real analysis in such theories is sketched.

We investigate the theories of linear algebra, which were originally defined to study the question of whether commutativity of matrix inverses has polysize Frege proofs. We give sentences separating quantified versions of these theories, and define a fragment in which we can interpret a weak theory V 1 of bounded arithmetic and carry out polynomial time reasoning about matrices - for example, we can formalize the Gaussian elimination algorithm. We show that, even if we restrict our language, proves (...) the commutativity of inverses. (shrink)

We define a new theory of concatenation WTC which is much weaker than Grzegorczyk's well-known theory TC. We prove that WTC is mutually interpretable with the weak theory of arithmetic R. The latter is, in a technical sense, much weaker than Robinson's arithmetic Q, but still essentially undecidable. Hence, as a corollary, WTC is also essentially undecidable.

In this article we present a number of axiomatic theories of truth which are conservative extensions of arithmetic. We isolate a set of ten natural principles of truth and prove that every consistent permutation of them forms a theory conservative over Peano arithmetic.

In the following paper we propose a model-theoretical way of comparing the “strength” of various truth theories which are conservative over $$ PA $$. Let $${\mathfrak {Th}}$$ denote the class of models of $$ PA $$ which admit an expansion to a model of theory $${ Th}$$. We show (combining some well known results and original ideas) that $$\begin{aligned} {{\mathfrak {PA}}}\supset {\mathfrak {TB}}\supset {{\mathfrak {RS}}}\supset {\mathfrak {UTB}}\supseteq \mathfrak {CT^-}, \end{aligned}$$ where $${\mathfrak {PA}}$$ denotes simply the class of all models (...) of $$ PA $$ and $${\mathfrak {RS}}$$ denotes the class of recursively saturated models of $$ PA $$. Our main original result is that every model of $$ PA $$ which admits an expansion to a model of $$ CT ^-$$, admits also an expansion to a model of $$ UTB $$. Moreover, as a corollary to one of the results (brought to us by Carlo Nicolai) we conclude that $$ UTB $$ is not relatively interpretable in $$ TB $$, thus answering the question from Fujimoto (Bull Symb Log 16:305–344, 2010). (shrink)

In this paper we study local induction w.r.t. Σ1‐formulas over the weak arithmetic. The local induction scheme, which was introduced in, says roughly this: for any virtual class that is progressive, i.e., is closed under zero and successor, and for any non‐empty virtual class that is definable by a Σ1‐formula without parameters, the intersection of and is non‐empty. In other words, we have, for all Σ1‐sentences S, that S implies, whenever is progressive. Since, in the weak context, we (...) have (at least) two definitions of Σ1, we obtain two minimal theories of local induction w.r.t. Σ1‐formulas, which we call Peano Corto and Peano Basso.In the paper we give careful definitions of Peano Corto and Peano Basso. We establish their naturalness both by giving a model theoretic characterization and by providing an equivalent formulation in terms of a sentential reflection scheme.The theories Peano Corto and Peano Basso occupy a salient place among the sequential theories on the boundary between weak and strong theories. They bring together a powerful collection of principles that is locally interpretable in. Moreover, they have an important role as examples of various phenomena in the metamathematics of arithmetical (and, more generally, sequential) theories. We illustrate this by studying their behavior w.r.t. interpretability, model interpretability and local interpretability. In many ways the theories are more like Peano arithmetic or Zermelo Fraenkel set theory, than like finitely axiomatized theories as Elementary Arithmetic, and. On the one hand, Peano Corto and Peano Basso are very weak: they are locally cut‐interpretable in. On the other hand, they behave as if they were strong: they are not contained in any consistent finitely axiomatized arithmetical theory, however strong. Moreover, they extend, the theory of parameter‐free Π1‐induction. (shrink)

We develop measure theory in the context of subsystems of second order arithmetic with restricted induction. We introduce a combinatorial principleWWKL (weak-weak König's lemma) and prove that it is strictly weaker thanWKL (weak König's lemma). We show thatWWKL is equivalent to a formal version of the statement that Lebesgue measure is countably additive on open sets. We also show thatWWKL is equivalent to a formal version of the statement that any Borel measure on a compact metric (...) space is countably additive on open sets. (shrink)

Hilbert's tenth problem for a theory T asks if there is an algorithm which decides for a given polynomial p() from [] whether p() has a root in some model of T. We examine some of the model-theoretic consequences that an affirmative answer would have in cases such as T = Open Induction and others, and apply these methods by providing a negative answer in the cases when T is some particular finite fragment of the weak theories IE1 (...) or IU-1. (shrink)

Paraconsistent Weak Kleene Logic is the 3-valued propositional logic defined on the weak Kleene tables and with two designated values. Most of the existing proof systems for PWK are characterised by the presence of linguistic restrictions on some of their rules. This feature can be seen as a shortcoming. We provide a cut-free calculus for PWK that is devoid of such provisos. Moreover, we introduce a Priest-style tableaux calculus for PWK.

The concepts of complementarity and entanglement are considered with respect to their significance in and beyond physics. A formally generalized, weak version of quantum theory, more general than ordinary quantum theory of physical systems, is outlined and tentatively applied to two examples.

Bundle Theory is the view that every concrete particular object is solely constituted by its universals. This theory is often criticized for not accommodating the possibility of symmetrical universes, such as one that contains two indiscernible spheres two meters from each other in otherwise empty space. One bundle theoretic solution to this criticism holds that the fact that the spheres stand in a weakly discerning—i.e., irreflexive and symmetric—relation, such as being two meters from, is sufficient for the numerical (...) diversity of the spheres. For this solution to be effective, however, it should be established that weak discernibility not only necessitates but also explains numerical diversity. In this paper, I argue that the fact that two objects have a certain distance between them does explain why they are non-identical. I also argue that the worry that the weak discernibility approach has some circularity problems is not well-founded. (shrink)

Proof-theoretic methods are developed for subsystems of Johansson’s logic obtained by extending the positive fragment of intuitionistic logic with weak negations. These methods are exploited to establish properties of the logical systems. In particular, cut-free complete sequent calculi are introduced and used to provide a proof of the fact that the systems satisfy the Craig interpolation property. Alternative versions of the calculi are later obtained by means of an appropriate loop-checking history mechanism. Termination of the new calculi is proved, (...) and used to conclude that the considered logical systems are PSPACE-complete. (shrink)

The phenomenon of weakness of will – not doing what we perceive as the best action – is not recognized by neoclassical economics due to the axiomatic assumptions of the revealed preference theory (RPT) that people do what is best for them. However, present bias shows that people have different preferences over time. As they cannot be compared by the utility measurements, economists need to normatively decide between selves (short- versus long-term preferences). A problem is that neoclassical economists perceive (...) RPT as value-free and incorporate present bias within the economic framework. The axiomatic assumption that people do what is best for them leads to theoretical and practical dilemmas. This work examines weakness of will to resolve some shortcomings of RPT. The concept of intention is used to provide multiple self conception with the framework to decide between selves, which had not been done before. The paper concludes that individuals should not always follow their revealed preferences (desires) but the intentions (reason) because the latter indicates what people really want. (shrink)

Bundle Theory is the view that every concrete particular object is solely constituted by its universals. This theory is often criticized for not accommodating the possibility of symmetrical universes, such as one that contains two indiscernible spheres two meters from each other in otherwise empty space. One bundle theoretic solution to this criticism holds that the fact that the spheres stand in a weakly discerning—i.e., irreflexive and symmetric—relation, such as being two meters from, is sufficient for the numerical (...) diversity of the spheres. For this solution to be effective, however, it should be established that weak discernibility not only necessitates but also explains numerical diversity. In this paper, I argue that the fact that two objects have a certain distance between them does explain why they are non-identical. I also argue that the worry that the weak discernibility approach has some circularity problems is not well-founded. (shrink)

A subtheory of the theory of self-referential truth known as FS is shown to be weak as a theory of truth but equivalent to full FS in its proof-theoretic strength.

We show how to interpret weak Kőnig's lemma in some recently defined theories of nonstandard arithmetic in all finite types. Two types of interpretations are described, with very different verifications. The celebrated conservation result of Friedman's about weak Kőnig's lemma can be proved using these interpretations. We also address some issues concerning the collecting of witnesses in herbrandized functional interpretations.

Elementary first-order theories of trees allowing at most, exactly $\mathrm{m}$, and any finite number of immediate descendants are introduced and proved mutually interpretable among themselves and with Robinson arithmetic, Adjunctive Set Theory with Extensionality and other well-known weak theories of numbers, sets, and strings.

We show that the existence of a weakly compact cardinal over the Zermelo–Fraenkel's set theory ZF is proof-theoretically reducible to iterations of Mostowski collapsings and Mahlo operations.

We present a scenario describing how time emerges in the framework of weak quantum theory. In a process similar to the emergence of time in quantum cosmology, time arises after an epistemic split of an undivided unus mundus as a quality of the individual conscious mind. Synchronization with matter and other mental systems is achieved by entanglement correlations. In the course of its operationalization, time loses its original quality and the time of physics as measured by clocks appears. (...) avoided/explicated. (shrink)

A relation is obtained between weak values of quantum observables and the consistency criterion for histories of quantum events. It is shown that “strange” weak values for projection operators always correspond to inconsistent families of histories. It is argued that using the ABL rule to obtain probabilities for counterfactual measurements corresponding to those strange weak values gives inconsistent results. This problem is shown to be remedied by using the conditional weight, or pseudo-probability, obtained from the multiple-time application (...) of Lüders’ Rule. It is argued that an assumption of reverse causality implies that weak values obtain, in a restricted sense, at the time of the weak measurement as well as at the time of post-selection. Finally, it is argued that weak values are more appropriately characterized as multiple-time amplitudes than expectation values, and as such can have little to say about counterfactual questions. (shrink)

ABSTRACT: A relation is obtained between weak values of quantum observables and the consistency criterion for histories of quantum events. It is shown that ``strange'' weak values for projection operators always correspond to inconsistent families of histories. It is argued that using the ABL rule to obtain probabilities for counterfactual measurements corresponding to those strange weak values gives inconsistent results. This problem is shown to be remedied by using the conditional weight, or pseudo-probability, obtained from the multiple-time (...) application of Luders' Rule. It is argued that an assumption of reverse causality implies that weak values obtain, in a restricted sense, at the time of the weak measurement as well as at the time of post-selection. Finally, it is argued that weak values are more appropriately characterised as multiple-time amplitudes than expectation values, and as such can have little to say about counterfactual questions. (shrink)

The concepts of complementarity and entanglement are considered with respect to their significance in and beyond physics. A formally generalized, weak version of quantum theory, more general than ordinary quantum theory of physical systems, is outlined and tentatively applied to two examples.

We study the class of weakly locally modular geometric theories introduced in [4], a common generalization of the classes of linear SU-rank 1 and linear o-minimal theories. We find new conditions equivalent to weak local modularity: "weak one-basedness", absence of type definable "almost quasidesigns", and "generic linearity". Among other things, we show that weak one-basedness is closed under reducts. We also show that the lovely pair expansion of a non-trivial weakly one-based ω-categorical geometric theory interprets an (...) infinite vector space over a finite field. (shrink)

There are well-known quasi-formal arguments that identity is a "strict" relation in at least the following three senses: (1) There is a single identity relation and a single distinctness relation; (2) There are no contingent cases of identity or distinctness; and (3) There are no vague or indeterminate cases of identity or distinctness. However, the situation is less clear cut than it at first may appear. There is a natural formal theory of identity that is very close to the (...) standard classical theory but which does not validate the formal analogues of (1)-(3). The core idea is simple: We weaken the Principle of the Indiscernibility of Identicals from a conditional to an entailment and we adopt a weakly classical logic. This paper investigates this weakly classical theory of identity (and related theories) and discusses its philosophical ramifications. It argues that we can accept a reasonable theory of identity without committing ourselves to the uniqueness, necessity, or determinacy of identity. (shrink)

Authority qua empowerment is the weak reading of authority in Hans Kelsen's writings. On the one hand, this reading appears to be unresponsive to the problem of authority as we know it from the tradition. On the other hand, it squares with legal positivism. Is Kelsen a legal positivist?Not without qualification. For he defends a normativity thesis along with the separation thesis, and it is at any rate arguable that the normativity thesis mandates a stronger reading of authority than (...) that modelled on empowerment. I offer, in the paper, a prima facie case on behalf of a stronger reading of authority in Kelsen. I go on to argue, however, that the textual evidence weighs heavily in favour of the weak reading. Both nomostatics and nomodynamics are pervasive points of view in the Pure Theory of Law, and both reflect species of empowerment as the endpoint of Kelsen's reconstructions. (shrink)

Weak filters were introduced by K. Schlechta in the ’90s with the aim of interpreting defaults via a generalized ‘most’ quantifier in first-order logic. They arguably represent the largest class of structures that qualify as a ‘collection of large subsets’ of a given index set |$I$|⁠, in the sense that it is difficult to think of a weaker, but still plausible, definition of the concept. The notion of weak ultrafilter naturally emerges and has been used in epistemic logic (...) and other knowledge representation (KR) applications. We provide a comprehensive exposition of weak filters and ultrafilters, comparing them with their classical counterparts that have found very important applications in logic, set theory and topology. Weak (ultra)filters capture the ‘majorities’ of social choice theory (which coincide with the commonsense understanding of a ‘large subset’) and in that respect, they outperform classical (ultra)filters in their role as ‘collections of large subsets’. Yet, they lack some of the elegant properties of classical (ultra)filters that make them an almost perfect match for logical theories. We investigate the extent to which some important classical results carry through in this new setting, and we focus on genuinely weak filters and genuinely weak ultrafilters. For weak ultrafilters, we proceed to provide concrete examples, answer questions of existence and characterize their construction. The class of weak (ultra)filters represents a genuine contribution of KR to set theory that might be of some interest to set theorists too and we initiate this study by providing a glimpse on natural set-theoretic questions. (shrink)

A relation is obtained between weak values of quantum observables and the consistency criterion for histories of quantum events. It is shown that “strange” weak values for projection operators always correspond to inconsistent families of histories. It is argued that using the ABL rule to obtain probabilities for counterfactual measurements corresponding to those strange weak values gives inconsistent results. This problem is shown to be remedied by using the conditional weight, or pseudo-probability, obtained from the multiple-time application (...) of Lüders’ Rule. It is argued that an assumption of reverse causality implies that weak values obtain, in a restricted sense, at the time of the weak measurement as well as at the time of post-selection. Finally, it is argued that weak values are more appropriately characterized as multiple-time amplitudes than expectation values, and as such can have little to say about counterfactual questions. (shrink)

This paper extends the theory of situated inference from Mares to treat two weak relevant logics, B and DJ. These logics are interesting because they can be used as bases for consistent naïve theories, such as naïve set theory. The concepts of a situation and of information that are employed by the theory of situated inference are used to justify various aspects of these logics and to give an interpretation of the notion of set that is (...) represented in the naïve set theories that are based on them. (shrink)

Authority qua empowerment is theweak reading of authority in Hans Kelsen's writings.On the one hand, this reading appears to beunresponsive to the problem of authority as we know itfrom the tradition. On the other hand, it squares withlegal positivism. Is Kelsen a legal positivist?Not without qualification. For he defends anormativity thesis along with the separation thesis,and it is at any rate arguable that the normativitythesis mandates a stronger reading of authority thanthat modelled on empowerment. I offer, in the paper,a prima (...) facie case on behalf of a stronger reading ofauthority in Kelsen. I go on to argue, however, thatthe textual evidence weighs heavily in favour of theweak reading. Both nomostatics and nomodynamics arepervasive points of view in the Pure Theory of Law,and both reflect species of empowerment as theendpoint of Kelsen's reconstructions. (shrink)

Kristiansen and Murwanashyaka recently proved that Robinson arithmetic, Q, is interpretable in an elementary theory of full binary trees, T. We prove that, conversely, T is interpretable in Q by producing a formal interpretation of T in an elementary concatenation theory QT+, thereby also establishing mutual interpretability of T with several well-known weak essentially undecidable theories of numbers, strings, and sets. We also introduce a “hybrid” elementary theory of strings and trees, WQT*, and establish its mutual (...) interpretability with Robinson’s weak arithmetic R, the weak theory of trees WT of Kristiansen and Murwanashyaka, and the weak concatenation theory WTCε of Higuchi and Horihata. (shrink)

ArgumentIn the theory-dominated view of scientific experimentation, all relations of theory and experiment are taken on a par; namely, that experiments are performed solely to ascertain the conclusions of scientific theories. As a result, different aspects of experimentation and of the relations of theory to experiment remain undifferentiated. This in turn fosters a notion of theory-ladenness of experimentation (TLE) that is toocoarse-grainedto accurately describe the relations of theory and experiment in scientific practice. By contrast, in (...) this article, I suggest that TLE should be understood as anumbrella conceptthat has different senses. To this end, I introduce a three-fold distinction among the theories of high-energy particle physics (HEP) as background theories, model theories, and phenomenological models. Drawing on this categorization, I contrast two types of experimentation, namely, “theory-driven” and “exploratory” experiments, and I distinguish between the “weak” and “strong” senses of TLE in the context of scattering experiments from the history of HEP. This distinction enables identifying the exploratory character of the deep-inelastic electron-proton scattering experiments – performed at the Stanford Linear Accelerator Center (SLAC) between the years 1967 and 1973 – thereby shedding light on a crucial phase of the history of HEP, namely, the discovery of “scaling,” which was the decisive step towards the construction of quantum chromo-dynamics as a gauge theory of strong interactions. (shrink)

We show that the partial order of Σ0 3-sets under inclusion is elementarily definable with parameters in the semilattice of r.e. wtt-degrees. Using a result of E. Herrmann, we can deduce that this semilattice has an undecidable theory, thereby solving an open problem of P. Odifreddi.

We investigate the interactions of formula complexity in weak set theories with the axioms available there. In particular, we show that swapping bounded and unbounded quantification preserves formula complexity in presence of the axiom of foundation weakened to an arbitrary set base, while it does not if the axiom of foundation is further weakened to a proper class base. More attention is being paid to the necessary axioms employed in the positive results, than to the combinatorial strength of the (...) positive results themselves. (shrink)

In the language \(\lbrace 0, 1, \circ, \preceq \rbrace \), where 0 and 1 are constant symbols, \(\circ \) is a binary function symbol and \(\preceq \) is a binary relation symbol, we formulate two theories, \( \textsf {WD} \) and \( {\textsf {D}}\), that are mutually interpretable with the theory of arithmetic \( {\textsf {R}} \) and Robinson arithmetic \({\textsf {Q}} \), respectively. The intended model of \( \textsf {WD} \) and \( {\textsf {D}}\) is the free semigroup (...) generated by \(\lbrace {\varvec{0}}, {\varvec{1}} \rbrace \) under string concatenation extended with the prefix relation. The theories \( \textsf {WD} \) and \( {\textsf {D}}\) are purely universally axiomatised, in contrast to \( {\textsf {Q}} \) which has the \(\varPi _2\) -axiom \(\forall x \; [ \ x = 0 \vee \exists y \; [ \ x = Sy \ ] \ ] \). (shrink)