The logic BKc1 is the basic constructive logic for weak consistency in the ternary relational semantics without a set of designated points. In this paper, a number of extensions of B Kc1 defined with a propositional falsity constant are defined. It is also proved that weak consistency is not equivalent to negation-consistency or absolute consistency in any logic included in positive contractionless intermediate logic LC plus the constructive negation of BKc1 and the contraposition axioms.

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)

Since Varian (Econometrica 50:945–973, 1982; Review of Economic Studies 50:90–110, 1983) made checking for consistency with revealed preference conditions more accessible to empirical researchers; researchers have often used revealed preference procedures to test their maintained hypotheses and narrow the scope of their demand studies. The tests developed by Varian are for the direct utility function, while researchers estimating demand systems often find it convenient to model consumer behavior with an indirect utility function. Unfortunately structure revealed in the direct utility (...) function does not necessarily follow for the indirect utility function. To remedy this problem, we set forth conditions for checking consumer data for consistency with revealed preference conditions for minimization and weak separability of the indirect utility function. (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)

We prove that the forcing axiom [Formula: see text] (stratified) implies [Formula: see text]. Using this implication, we show that the forcing axiom [Formula: see text] is inconsistent. We also derive weak Chang’s Conjecture from [Formula: see text] (stratified) and use this second implication to give another proof of the inconsistency of [Formula: see text].

Journal of Mathematical Logic, Ahead of Print. We prove that the forcing axiom [math] (stratified) implies [math]. Using this implication, we show that the forcing axiom [math] is inconsistent. We also derive weak Chang’s Conjecture from [math] (stratified) and use this second implication to give another proof of the inconsistency of [math].

We prove that the Gödel incompleteness theorem holds for a weak arithmetic T = IΔ0 + Ω2 in the form where Cons H (T) is an arithmetic formula expressing the consistency of T with respect to the Herbrand notion of provability.

In abstract algebraic logic, many systems, such as those paraconsistent logics taking inspiration from da Costa's hierarchy, are not algebraizable by even the broadest standard methodologies, as that of Blok and Pigozzi. However, these logics can be semantically characterized by means of non-deterministic algebraic structures such as Nmatrices, RNmatrices and swap structures. These structures are based on multialgebras, which generalize algebras by allowing the result of an operation to assume a non-empty set of values. This leads to an interest in (...) exploring the foundations of multialgebras applied to the study of logic systems. It is well known from universal algebra that, for every signature \, there exist algebras over \ which are absolutely free, meaning that they do not satisfy any identities or, alternatively, satisfy the universal mapping property for the class of \-algebras. Furthermore, once we fix a cardinality of the generating set, they are, up to isomorphisms, unique, and equal to algebras of terms. Equivalently, the forgetful functor, from the category of \-algebras to Set, has a left adjoint. This result does not extend to multialgebras. Not only multialgebras satisfying the universal mapping property do not exist, but the forgetful functor \, from the category of \-multialgebras to Set, does not have a left adjoint. In this paper we generalize, in a natural way, algebras of terms to multialgebras of terms, whose family of submultialgebras enjoys many properties of the former. One example is that, to every pair consisting of a function, from a submultialgebra of a multialgebra of terms to another multialgebra, and a collection of choices, there corresponds a unique homomorphism, what resembles the universal mapping property. Another example is that the multialgebras of terms are generated by a set that may be viewed as a strong basis, which we call the ground of the multialgebra. Submultialgebras of multialgebras of terms are what we call weakly free multialgebras. Finally, with these definitions at hand, we offer a simple proof that multialgebras with the universal mapping property for the class of all multialgebras do not exist and that \ does not have a left adjoint. (shrink)

In this article, we introduce the notion of weakly measurable cardinal, a new large cardinal concept obtained by weakening the familiar concept of a measurable cardinal. Specifically, a cardinal κ is weakly measurable if for any collection equation image containing at most κ+ many subsets of κ, there exists a nonprincipal κ-complete filter on κ measuring all sets in equation image. Every measurable cardinal is weakly measurable, but a weakly measurable cardinal need not be measurable. Moreover, while the GCH cannot (...) fail first at a measurable cardinal, I will show that it can fail first at a weakly measurable cardinal. More generally, if κ is measurable, then we can make its weak measurability indestructible by the forcing Add for any η while forcing the GCH to hold below κ. Nevertheless, I shall prove that weakly measurable cardinals and measurable cardinals are equiconsistent. © 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim. (shrink)

We show that the consistency of the theories “ holds below ” + “there is an injection ” + “both and fail” and + “ holds below ” + “there is an injection ” + “ satisfies the tree property” follow from the appropriate supercompactness hypotheses. These provide answers in a choiceless context to certain long‐standing open questions concerning, weak square, approachability, and the tree property. There is nothing special about, and the injection into can be from any (...) ordinal λ (which means that pcf theory can fail badly in the models constructed if ). (shrink)

I argue that a compulsive seeking for just one sense of consistency is hazardous to rationality, and that observing the subtle distinctions of reasonableness between individual and groups may suggest wider, structuralistic notions of consistency, even relevant to re-assessing Gödei's Second Incompleteness Theorem and to science as a whole.

Our last big theorem – Theorem 6 – tells us that if a theory meets certain conditions, then it must be negation incomplete. And we made some initial arm-waving remarks to the effect that it seems plausible that we should want theories which meet those conditions. Later, we announced that there actually is a consistent weak arithmetic with a first-order logic which meets the conditions (in which case, stronger arithmetics will also meet the conditions); but we didn’t say anything (...) about what such a weak theory really looks like. In fact, we haven’t looked at any detailed theory of arithmetic yet! It is high time, then, that we stop operating at the extreme level of abstraction of Episodes 1 and 2, and start getting our hands dirty. This Episode introduces a couple of weak arithmetics, before we tackle the canonical first-order arithmetic PA in the following instalment. By all means skip fairly lightly over some of the more boring proof details! But it is certainly worth getting just a flavour of how these two simple formal theories work. (shrink)

In this paper, consistency is understood as the absence of the negation of a theorem, and not, in general, as the absence of any contradiction. We define the basic constructive logic BKc1 adequate to this sense of consistency in the ternary relational semantics without a set of designated points. Then we show how to define a series of logics extending BKc1 within the spectrum delimited by contractionless minimal intuitionistic logic. All logics defined in the paper are paraconsistent logics.

Given a graph G whose set of vertices is a Polish space X, the weak Borel chromatic number of G is the least size of a family of pairwise disjoint G -independent Borel sets that covers all of X. Here a set of vertices of a graph G is independent if no two vertices in the set are connected by an edge.We show that it is consistent with an arbitrarily large size of the continuum that every closed graph on (...) a Polish space either has a perfect clique or has a weak Borel chromatic number of at most ℵ1. We observe that some weak version of Todorcevic's Open Coloring Axiom for closed colorings follows from MA.Slightly weaker results hold for Fσ-graphs. In particular, it is consistent with an arbitrarily large size of the continuum that every locally countable Fσ-graph has a Borel chromatic number of at most ℵ1.We refute various reasonable generalizations of these results to hypergraphs. (shrink)

In a standard sense, consistency and paraconsistency are understood as the absence of any contradiction and as the absence of the ECQ (‘E contradictione quodlibet’) rule, respectively. The concepts of weak consistency (in two different senses) as well as that of F -consistency have been defined by the authors. The aim of this paper is (a) to define alternative (to the standard one) concepts of paraconsistency in respect of the aforementioned notions of weak consistency (...) and F -consistency; (b) to define the concept of strong paraconsistency; (c) to build up a series of strongly paraconsistent logics; (d) to define the basic constructive logic adequate to a rather weak sense of consistency. All logics treated in this paper are strongly paraconsistent. All of them are sound and complete in respect a modification of Routley and Meyer’s ternary relational semantics for relevant logics (no logic in this paper is relevant). (shrink)

We clarify the significance of quasiprobability in quantum mechanics that is relevant in describing physical quantities associated with a transition process. Our basic quantity is Aharonov’s weak value, from which the QP can be defined up to a certain ambiguity parameterized by a complex number. Unlike the conventional probability, the QP allows us to treat two noncommuting observables consistently, and this is utilized to embed the QP in Bohmian mechanics such that its equivalence to quantum mechanics becomes more transparent. (...) We also show that, with the help of the QP, Bohmian mechanics can be recognized as an ontological model with a certain type of contextuality. (shrink)

According to Hitchcock and Sober’s argument from overfitting for weak predictivism, the fact that a theory accurately predicts a portion of its data is evidence that it has been formulated by balancing simplicity and goodness-of-fit rather than overfitting data. The core argument consists of two likelihood inequalities. In this paper I show that there is a surprising accommodation-friendly implication in their argument, and contend that it is beset by a substantial difficulty, namely, there is no good reason to think (...) that their second likelihood inequality is true. (shrink)

I present an intractable puzzle for the currently popular view that belief is weak—the view that expressions like ‘S believes p’ ascribe to S a doxastic attitude towards p that is rationally compatible with low credence that p. The puzzle concerns issues that arise on considering beliefs in conditionals. I show that proponents of weak belief either cannot consistently apply their preferred methodology when accommodating beliefs in conditionals, or they must deny that beliefs in conditionals can be used (...) in reasoning. (shrink)

We consider a weak version of Schindler’s remarkable cardinals that may fail to be ${{\rm{\Sigma }}_2}$-reflecting. We show that the ${{\rm{\Sigma }}_2}$-reflecting weakly remarkable cardinals are exactly the remarkable cardinals, and that the existence of a non-${{\rm{\Sigma }}_2}$-reflecting weakly remarkable cardinal has higher consistency strength: it is equiconsistent with the existence of an ω-Erdős cardinal. We give an application involving gVP, the generic Vopěnka principle defined by Bagaria, Gitman, and Schindler. Namely, we show that gVP + “Ord is (...) not ${{\rm{\Delta }}_2}$-Mahlo” and ${\text{gVP}}$ + “there is no proper class of remarkable cardinals” are both equiconsistent with the existence of a proper class of ω-Erdős cardinals, extending results of Bagaria, Gitman, Hamkins, and Schindler. (shrink)

Philosophical orthodoxy identifies weakness of will with akrasia: the weak willed person is someone who intentionally acts against their better judgement. It is argued that this is a mistake. Weakness of will consists in a quite different failing, namely an over-ready revision of one's intentions. Building on the work of Bratman, an account of such over-ready revision is given. A number of examples are then adduced showing how weakness of will, so understood, differs from akrasia.

In his “Two Kinds of Moral Reasoning; Ethical Egoism as a Moral Theory”, Jesse Kalin defines ethical egoism as “the position that a person ought, all things considered, to do an action if and only if that action is in his overall self-interest”, by which he means that each person is ‘rationally justified in’ or ‘has conclusive reasons for’ acting thus, and not that ‘it is good', or that ‘it is desirable', or that ‘it conduces to any intrinsically desirable state (...) of affairs', for each to act only self-interestedly.In this way, Kalin seeks to formulate an egoism which he takes to be rational, insofar as, in the interests of consistency, the egoist holds a principle applicable to all, and yet is not committed, ex hypothesi, to valuing collective goods or states of affairs which would tend to compromise his own interests. (shrink)

Weak and strong consistency of the Abstract Principal Principle are defined in terms of classical probability measure spaces. It is proved that the Abstract Principal Principle is both weakly and strongly consistent. The Abstract Principal Principle is strengthened by adding a stability requirement to it. Weak and strong consistency of the resulting Stable Abstract Principal Principle are defined. It is shown that the Stable Abstract Principal Principle is weakly consistent. Strong consistency of the Stable Abstract (...) Principal principle remains an open question. (shrink)

In abstract algebraic logic, many systems, such as those paraconsistent logics taking inspiration from da Costa's hierarchy, are not algebraizable by even the broadest standard methodologies, as that of Blok and Pigozzi. However, these logics can be semantically characterized by means of non-deterministic algebraic structures such as Nmatrices, RNmatrices and swap structures. These structures are based on multialgebras, which generalize algebras by allowing the result of an operation to assume a non-empty set of values. This leads to an interest in (...) exploring the foundations of multialgebras applied to the study of logic systems. -/- It is well known from universal algebra that, for every signature Sigma, there exist algebras over Sigma which are absolutely free, meaning that they do not satisfy any identities or, alternatively, satisfy the universal mapping property for the class of Sigma-algebras. Furthermore, once we fix a cardinality of the generating set, they are, up to isomorphisms, unique, and equal to algebras of terms (or propositional formulas, in the context of logic). Equivalently, the forgetful functor, from the category of Sigma-algebras to Set, has a left adjoint. This result does not extend to multialgebras. Not only multialgebras satisfying the universal mapping property do not exist, but the forgetful functor U, from the category of Sigma-multialgebras to Set, does not have a left adjoint. -/- In this paper we generalize, in a natural way, algebras of terms to multialgebras of terms, whose family of submultialgebras enjoys many properties of the former. One example is that, to every pair consisting of a function, from a submultialgebra of a multialgebra of terms to another multialgebra, and a collection of choices (which selects how a homomorphism approaches indeterminacies), there corresponds a unique homomorphism, what resembles the universal mapping property. Another example is that the multialgebras of terms are generated by a set that may be viewed as a strong basis, which we call the ground of the multialgebra. Submultialgebras of multialgebras of terms are what we call weakly free multialgebras. Finally, with these definitions at hand, we offer a simple proof that multialgebras with the universal mapping property for the class of all multialgebras do not exist and that U does not have a left adjoint. (shrink)

According to the Weak Supplementation Principle (WSP)—a widely received principle of mereology—an object with a proper part, p , has another distinct proper part that doesn't overlap p . In a recent article in this journal, Nikk Effingham and Jon Robson employ WSP in an objection to endurantism. I defend endurantism in a way that bears on mereology in general. First, I argue that denying WSP can be motivated apart from the truth of endurantism. I then go on to (...) offer an explanation of WSP's initial appeal, argue that denying WSP fails to have untoward consequences for the rest of mereology, and show that the falsity of WSP is consistent with a primary guiding thought behind it. (shrink)

We prove that \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${(\omega_3, \omega_2) \twoheadrightarrow (\omega_2, \omega_1)}$$\end{document} implies there is an inner model with a weak repeat measure.

This paper shows that our popular account of weakness of will is inconsistent with dilemmas. In dilemmas, agents judge that they ought to do one thing, that they ought to do something else, and that they cannot do both. They must act against either of their two judgments. But such action is commonly understood as weakness of will. An agent is weak-willed in doing something if she judges that she ought to and could do something else instead. Thus, it (...) seems that, in a dilemma, the agent is weak-willed by definition. But this is puzzling: clearly, the two are different phenomena. The puzzle may support scepticism about weakness of will or dilemmas. Here, I argue that the two are consistent on a revised understanding of weakness of will. To do so, I further distinguish the mental states of an agent in a dilemma from those of a weak-willed person. (shrink)

We investigate how weak square principles are denied by Chang’s Conjecture and its generalizations. Among other things we prove that Chang’s Conjecture does not imply the failure of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\square_{\omega_1, 2}}$$\end{document}, i.e. Chang’s Conjecture is consistent with \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\square_{\omega_1, 2}}$$\end{document}.

The best developed formulation of closed system quantum theory that handles multiple-time statements, is the consistent (or decoherent) histories approach. The most important weaknesses of the approach is that it gives rise to many different consistent sets, and it has been argued that a complete interpretation should be accompanied with a natural mechanism leading to a (possibly) unique preferred consistent set. The existence of multiple consistent sets becomes more problematic because it allows the existence of contrary inferences [1]. We analyse (...) the conceptual difficulties that arise from the existence of multiple consistent sets and provide a suggestion for a natural set selection criterion. This criterion does not lead to a unique physical consistent set, however it evades the existence of consistent sets with contrary inferences. The criterion is based on the concept of preclusion and the requirement that probability one propositions and their inferences should be non-contextual. The allowed consistent sets turn-out to be compatible with coevents which are the ontology of an alternative, histories based, formulation [2–4]. (shrink)

In recent years, proof theoretic transformations that are based on extensions of monotone forms of Gödel’s famous functional interpretation have been used systematically to extract new content from proofs in abstract nonlinear analysis. This content consists both in effective quantitative bounds as well as in qualitative uniformity results. One of the main ineffective tools in abstract functional analysis is the use of sequential forms of weak compactness. As we recently verified, the sequential form of weak compactness for bounded (...) closed and convex subsets of an abstract Hilbert space can be carried out in suitable formal systems that are covered by existing metatheorems developed in the course of the proof mining program. In particular, it follows that the monotone functional interpretation of this weak compactness principle can be realized by a functional Ω∗ definable from bar recursion of lowest type. While a case study on the analysis of strong convergence results that are based on weak compactness indicates that the use of the latter seems to be eliminable, things apparently are different for weak convergence theorems such as the famous Baillon nonlinear ergodic theorem. For this theorem we recently extracted an explicit bound on a metastable version of this theorem that is primitive recursive relative to Ω∗.In the current paper we for the first time give the construction of Ω∗ . As a corollary to the fine analysis of the use of bar recursion in this construction we obtain that Ω∗ elevates arguments in Tn at most to resulting functionals in Tn+2 . In particular, one can conclude from this that our bound on Baillon’s theorem is at least definable in T4. (shrink)

David Alexander has argued that “weak inferential internalism” (WII), a position which amounts to a qualified endorsement of Richard Fumerton’s controversial “principle of inferential justification,” is subject to a fatal dilemma: Either it collapses into externalism or it must make an arbitrary epistemic distinction between persons who believe the same proposition for the same reasons. In this paper, I argue that the dilemma is a false one, for weak inferential internalism does not entail internalism simpliciter. Indeed, WII is (...) compatible with modest externalism, and so is consistent with what Armstrong calls “Type II justification,” the rejection of which leads to the arbitrary epistemic distinctions to which he rightly objects. (shrink)

The quantum theoretical concepts of modular momentum and dynamical non-locality, which were introduced four decades ago, have recently been used to explain single particle quantum interference phenomena. Although the non-local exchange of modular momentum associated with such phenomena cannot be directly observed, it has been suggested that effects induced by this exchange can be measured experimentally using weak measurements of pre- and post-selected ensembles of particles. This paper reports on such an optical experiment that yielded measured weak values (...) that were consistent with the theoretical prediction of an effect induced by a non-local exchange of modular momentum. (shrink)

Recently, a number of experimental philosophers have converged on the position that the ordinary concept of weakness of will does not solely consist in “judgment” or “intention” violation but is more like a cluster concept in which each factor plays contributory roles in the application of the concept. This, however, raises the question as to which factor is more central or plays a more significant role in folk’s understanding of the concept. I contend that the ordinary concept of weakness of (...) will is primarily constituted by the “executive commitment” rather than the “evaluative commitment” practices. Drawing on extensive evidence from developmental psychology, I will argue that the executive commitment, which, as I will show, involve intention recognition and metarepresentation, is developmentally prior and more fundamental in our exercise and intuitive understanding of the concept. (shrink)

There are two standard ways to establish consistency in set theory. One is to prove consistency using inner models, in the way that Gödel proved the consistency of GCH using the inner model L. The other is to prove consistency using outer models, in the way that Cohen proved the consistency of the negation of CH by enlarging L to a forcing extension L[G].But we can demand more from the outer model method, and we illustrate (...) this by examining Easton's strengthening of Cohen's result:Theorem 1. There is a forcing extensionL[G] of L in which GCH fails at every regular cardinal.Assume that the universe V of all sets is rich in the sense that it contains inner models with large cardinals. Then what is the relationship between Easton's model L[G] and V? In particular, are these models compatible, in the sense that they are inner models of a common third model? If not, then the failure of GCH at every regular cardinal is consistent only in a weak sense, as it can only hold in universes which are incompatible with the universe of all sets. Ideally, we would like L[G] to not only be compatible with V, but to be an inner model of V.We say that a statement is internally consistent iff it holds in some inner model, under the assumption that there are innermodels with large cardinals. (shrink)

We prove that a form of the $Erd\H{o}s$ property (consistent with $V = L\lbrack H_{\omega_2}\rbrack$ and strictly weaker than the Weak Chang's Conjecture at ω1), together with Bounded Martin's Maximum implies that Woodin's principle $\psi_{AC}$ holds, and therefore 2ℵ0 = ℵ2. We also prove that $\psi_{AC}$ implies that every function $f: \omega_1 \rightarrow \omega_1$ is bounded by some canonical function on a club and use this to produce a model of the Bounded Semiproper Forcing Axiom in which Bounded Martin's (...) Maximum fails. (shrink)

S There is a long tradition of representing causal relationships by directed acyclic graphs (Wright, 1934 ). Spirtes ( 1994), Spirtes et al. ( 1993) and Pearl & Verma ( 1991) describe procedures for inferring the presence or absence of causal arrows in the graph even if there might be unobserved confounding variables, and/or an unknown time order, and that under weak conditions, for certain combinations of directed acyclic graphs and probability distributions, are asymptotically, in sample size, consistent. These (...) results are surprising since they seem to contradict the standard statistical wisdom that consistent estimators of causal effects do not exist for nonrandomised studies if there are potentially unobserved confounding variables. We resolve the apparent incompatibility of these views by closely examining the asymptotic properties of these causal inference procedures. We show that the asymptotically consistent procedures are ‘pointwise consistent’, but ‘uniformly consistent’ tests do not exist. Thus, no finite sample size can ever be guaranteed to approximate the asymptotic results. We also show the nonexistence of valid, consistent confidence intervals for causal effects and the nonexistence of uniformly consistent point estimators. Our results make no assumption about the form of the tests or estimators. In particular, the tests could be classical independence tests, they could be Bayes tests or they could be tests based on scoring methods such as  or . The implications of our results for observational studies are controversial and are discussed briefly in the last section of the paper. The results hinge on the following fact: it is possible to find, for each sample size n, distributions P and Q such that P and Q are empirically indistinguishable and yet P and Q correspond to different causal effects. (shrink)

Fine has shown that assigning any value to the Pasadena game is consistent with a certain standard set of axioms for decision theory. However, I suggest that it might be reasonable to believe that the value of an individual game is constrained by the long-run payout of repeated plays of the game. Although there is no value that repeated plays of the Pasadena game converges to in the standard strong sense, I show that there is a weaker sort of convergence (...) it exhibits, and use this to define a notion of ‘weak expectation’ that can give values to the Pasadena game and many others, though not to all games that fail to have a strong expectation in the standard sense. CiteULike Connotea Del.icio.us What's this? (shrink)

We give a consistency proof within a weak fragment of arithmetic of elementary algebra and geometry. For this purpose, we use EFA (exponential function arithmetic), and various first order theories of algebraically closed fields and real closed fields.

We characterize the existence of semicontinuous weak utilities in a general framework, where the axioms of transitivity and acyclicity are relaxed to that of consistency in the sense of Suzumura (Economica 43:381–390, 1976). This kind of representations allow us to transfer the problem of the existence of the ${{\mathcal{G}}{\mathcal{O}}{\mathcal{C}}{\mathcal{H}}{\mathcal{A}}}$ set of a binary relation to the easier problem of getting maxima of a real function. Finally, we show that the maxima of these representations correspond to the different levels (...) of satiation that each of individual has (an individual reaches his or her level of satiation when an increase of consuming an alternative product/service brings no increase in utility). (shrink)

By , we denote the system of second-order arithmetic based on recursive comprehension axioms and Σ10 induction. is defined to be plus weak König's lemma: every infinite tree of sequences of 0's and 1's has an infinite path. In this paper, we first show that for any countable model M of , there exists a countable model M′ of whose first-order part is the same as that of M, and whose second-order part consists of the M-recursive sets and sets (...) not in the second-order part of M. By combining this fact with a certain forcing argument over universal trees, we obtain the following result : if proves X!Y with arithmetical, so does . We also discuss several improvements of this results. (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)

I defend a contextualist account of bare epistemic modal claims against recent objections. I argue that in uttering a sentence of the form ‘It might be that p,’ a speaker is performing two speech acts. First, she is (directly) asserting that in view of the knowledge possessed by some relevant group, it might be that p. The content of this first speech act is accounted for by the contextualist view. But the speaker's utterance also generates an indirect speech act that (...) consists in a weak suggestive that p. Since this second speech act is typically the main point of a bare epistemic modal utterance, our (negative or positive) responses to the utterance actually target this second speech act. I show how this two-speech-act account can explain the data recently adduced against contextualism. (shrink)

Dzhaparidze, G., A generalized notion of weak interpretability and the corresponding modal logic, Annals of Pure and Applied Logic 61 113-160. A tree Tr of theories T1,...,Tn is called tolerant, if there are consistent extensions T+1,...,T+n of T1,...,Tn, where each T+i interprets its successors in the tree Tr. We consider a propositional language with the following modal formation rule: if Tr is a tree of formulas, then Tr is a formula, and axiomatically define in this language the decidable logics (...) TLR and TLRω. It is proved that TLR yields exactly the schemata of PA-provable sentences, if Tr is understood as “Tr is tolerant”. In fact, TLR axiomatizes a considerable fragment of provability logic with quantifiers over ∑1-sentences, and many relations that have been studied in the literature can be expressed in terms of tolerance. We introduce and study two more relations between theories: cointerpretability and cotolerance which are, in a sense, dual to interpretability and tolerance. Cointerpretability is a characterization of ∑1-conservativity for essentially reflexive theories in terms of translations. (shrink)

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.

Weak Quantum Theory (WQT) and the Model of Pragmatic Information (MPI) are two psychophysical concepts developed on the basis of quantum physics. The present study contributes to their empirical examination. The issue of the study is whether WQT and MPI can not only explain ‘psi’-phenomena theoretically but also prove to be consistent with the empirical phenomenology of extrasensory perception (ESP). From the main statements of both models, 33 deductions for psychic readings are derived. Psychic readings are defined as settings, (...) in which psychics support or counsel clients by using information not mediated through the five senses. A qualitative approach is chosen to explore how the psychics experience extrasensory perceptions. Eight psychics are interviewed with a half-structured method. The reports are examined regarding deductive and inductive aspects, using a multi-level structured content analysis. The vast majority of deductions is clearly confirmed by the reports. Even though the study has to be seen as an explorative attempt with many aspects to be specified, WQT and MPI prove to be coherent and helpful concepts to explain ESP in psychic readings. (shrink)

This paper extends Fitting’s epistemic interpretation of some Kleene logics to also account for Paraconsistent Weak Kleene logic. To achieve this goal, a dualization of Fitting’s “cut-down” operator is discussed, leading to the definition of a “track-down” operator later used to represent the idea that no consistent opinion can arise from a set including an inconsistent opinion. It is shown that, if some reasonable assumptions are made, the truth-functions of Paraconsistent Weak Kleene coincide with certain operations defined in (...) this track-down fashion. Finally, further reflections on conjunction and disjunction in the weak Kleene logics accompany this paper, particularly concerning their relation with containment logics. These considerations motivate a special approach to defining sound and complete Gentzen-style sequent calculi for some of their four-valued generalizations. (shrink)