The brain displays both the anatomical features of a vast amount of interconnected topological mappings as well as the functional features of a nonlinear, metastable system at the edge of chaos, equipped with a phase space where mental random walks tend towards lower energetic basins. Nevertheless, with the exception of some advanced neuro-anatomic descriptions and present-day connectomic research, very few studies have been addressing the topological path of a brain embedded or embodied in its external and internal environment. Herein, by (...) using new formal tools derived from algebraic topology, we provide an account of the metastable brain, based on the neuro-scientific model of Operational Architectonics of brain-mind functioning. We introduce a “topodynamic” description that shows how the relationships among the countless intertwined spatio-temporal levels of brain functioning can be assessed in terms of projections and mappings that take place on abstract structures, equipped with different dimensions, curvatures and energetic constraints. Such a topodynamical approach, apart from providing a biologically plausible model of brain function that can be operationalized, is also able to tackle the issue of a long-standing dichotomy: it throws indeed a bridge between the subjective, immediate datum of the naïve complex of sensations and mentations and the objective, quantitative, data extracted from experimental neuro-scientific procedures. Importantly, it opens the door to a series of new predictions and future directions of advancement for neuroscientific research. (shrink)

The interpretation of propositions in Lukasiewicz's infinite-valued calculus as answers in Ulam's game with lies--the Boolean case corresponding to the traditional Twenty Questions game--gives added interest to the completeness theorem. The literature contains several different proofs, but they invariably require technical prerequisites from such areas as model-theory, algebraic geometry, or the theory of ordered groups. The aim of this paper is to provide a self-contained proof, only requiring the rudiments of algebra and convexity in finite-dimensional vector spaces.

The discrepancy between syntax and semantics is a painstaking issue that hinders a better comprehension of the underlying neuronal processes in the human brain. In order to tackle the issue, we at first describe a striking correlation between Wittgenstein's Tractatus, that assesses the syntactic relationships between language and world, and Perlovsky's joint language-cognitive computational model, that assesses the semantic relationships between emotions and “knowledge instinct”. Once established a correlation between a purely logical approach to the language and computable psychological activities, (...) we aim to find the neural correlates of syntax and semantics in the human brain. Starting from topological arguments, we suggest that the semantic properties of a proposition are processed in higher brain's functional dimensions than the syntactic ones. In a fully reversible process, the syntactic elements embedded in Broca's area project into multiple scattered semantic cortical zones. The presence of higher functional dimensions gives rise to the increase in informational content that takes place in semantic expressions. Therefore, diverse features of human language and cognitive world can be assessed in terms of both the logic armor described by the Tractatus, and the neurocomputational techniques at hand. One of our motivations is to build a neuro-computational framework able to provide a feasible explanation for brain's semantic processing, in preparation for novel computers with nodes built into higher dimensions. (shrink)

In this article, we make analysis of the implicit fractional differential equations involving integral boundary conditions associated with Stieltjes integral and its corresponding coupled system. We use some sufficient conditions to achieve the existence and uniqueness results for the given problems by applying the Banach contraction principle, Schaefer’s fixed point theorem, and Leray–Schauder result of the cone type. Moreover, we present different kinds of stability such as Hyers–Ulam stability, generalized Hyers–Ulam stability, Hyers–Ulam–Rassias stability, and generalized Hyers– (...) class='Hi'>Ulam–Rassias stability by using the classical technique of functional analysis. At the end, the results are verified with the help of examples. (shrink)

The task of computing a function F with the help of an oracle X can be viewed as a search problem where the cost measure is the number of queries to X. We ask for the minimal number that can be achieved by a suitable choice of X and call this quantity the query complexity of F. This concept is suggested by earlier work of Beigel, Gasarch, Gill, and Owings on “Bounded query classes”. We introduce a fault tolerant version and (...) relate it with Ulam's game. For many natural classes of functions F we obtain tight upper and lower bounds on the query complexity of F. Previous results like the Nonspeedup Theorem and the Cardinality Theorem appear in a wider perspective. (shrink)

In this paper, DSEK model with fractional derivatives of the Atangana-Baleanu Caputo is proposed. This paper gives a brief overview of the ABC fractional derivative and its attributes. Fixed point theory has been used to establish the uniqueness and existence of solutions for the fractional DSEK model. According to this theory, we will define two operators based on Lipschitzian and prove that they are contraction mapping and relatively compact. Ulam-Hyers stability theorem is implemented to prove the fractional DSEK (...) model’s stability in Banach space. Also, fractional Euler’s numerical method is derived for initial value problems with ABC fractional derivative and implemented on fractional DSEK model. The symmetric properties contribute to determining the appropriate method for finding the correct solution to fractional differential equations. The numerical solutions generated using fractional Euler’s method have been plotted for different values of α where α ∈ 0,1 and different step sizes h. Result discussion will be given, describing the changes that occur due to the step size h. (shrink)

We show a faithful restriction theorem among infinite chains which implies a reconstructibility conjecture of Halin. This incite us to study the reconstructibility in the sense of Fraïssé and to prove it for orders of cardinality infinite or ≥ 3 and for multirelations of cardinality infinite or ≥ 7, what improves the theory obtained by G. Lopez in the finite case. For this work we had to study the infinite classes of difference which have to be a linear order (...) of type ω, ω* or ω* + ω; this complete the theory made by G. Lopez for the finite case . We show also Ulam-reconstructibility for linear orders which have a fixed point. (shrink)

Hypersequent calculi can formalize various non-classical logics. In [9] we presented a non-commutative variant of HC for the weakest temporal logic of linear frames Kt4.3 and some its extensions for dense and serial flow of time. The system was proved to be cut-free HC formalization of respective temporal logics by means of Schütte/Hintikka-style semantical argument using models built from saturated hypersequents. In this paper we present a variant of this calculus for Kt4.3 with a constructive syntactical proof of cut elimination.

A search is under way for a theory that can accommodate our intuitions in population axiology. The object of this search has proved elusive. This is not surprising since, as we shall see, any welfarist axiology that satisfies three reasonable conditions implies at least one of three counter-intuitive conclusions. I shall start by pointing out the failures in three recent attempts to construct an acceptable population axiology. I shall then present an impossibility theorem and conclude with a short discussion (...) of how it might be extended to pluralist axiologies, that is, axiologies that take more values than welfare into account. (shrink)

In this entry, Frege’s logic is introduced and described in some detail. It is shown how the Dedekind-Peano axioms for number theory can be derived from a consistent fragment of Frege’s logic, with Hume’s Principle replacing Basic Law V.

Although the philosophical literature on the foundations of quantum field theory recognizes the importance of Haag’s theorem, it does not provide a clear discussion of the meaning of this theorem. The goal of this paper is to make up for this deficit. In particular, it aims to set out the implications of Haag’s theorem for scattering theory, the interaction picture, the use of non-Fock representations in describing interacting fields, and the choice among the plethora of the unitarily (...) inequivalent representations of the canonical commutation relations for free and interacting fields. (shrink)

This paper investigates the role of conditionals in hypothetical reasoning and rational decision making. Its main result is a proof of a representation theorem for preferences defined on sets of sentences (and, in particular, conditional sentences), where an agent’s preference for one sentence over another is understood to be a preference for receiving the news conveyed by the former. The theorem shows that a rational preference ordering of conditional sentences determines probability and desirability representations of the agent’s degrees (...) of belief and desire that satisfy, in the case of non-conditional sentences, the axioms of Jeffrey’s decision theory and, in the case of conditional sentences, Adams’ expression for the probabilities of conditionals. Furthermore, the probability representation is shown to be unique and the desirability representation unique up to positive linear transformation. (shrink)

This little gem is stated unbilled and proved in the last two lines of §2 of the short note Kleene [1938]. In modern notation, with all the hypotheses stated explicitly and in a strong form, it reads as follows:Second Recursion Theorem. Fix a set V ⊆ ℕ, and suppose that for each natural number n ϵ ℕ = {0, 1, 2, …}, φn: ℕ1+n ⇀ V is a recursive partial function of arguments with values in V so that the (...) standard assumptions and hold with. Every n-ary recursive partial function with values in V is for some e. For all m, n, there is a recursive function : Nm+1 → ℕ such that.Then, for every recursive, partial function f of arguments with values in V, there is a total recursive function of m arguments such thatProof. Fix e ϵ ℕ such that and let.We will abuse notation and write ž; rather than ž() when m = 0, so that takes the simpler formin this case ). (shrink)

I note that the logics of the relevant group most closely tied to the research programme in paraconsistency are those without the contraction postulate(A.AB).AB and its close relatives. As a move towards gaining control of the contraction-free systems I show that they are prime (that wheneverA B is a theorem so is eitherA orB). The proof is an extension of the metavaluational techniques standardly used for analogous results about intuitionist logic or the relevant positive logics.

Given classical (2 valued) structures and and a homomorphism h of onto , it is shown how to construct a (non-degenerate) 3-valued counterpart of . Classical sentences that are true in are non-false in . Applications to number theory and type theory (with axiom of infinity) produce finite 3-valued models in which all classically true sentences of these theories are non-false. Connections to relevant logic give absolute consistency proofs for versions of these theories formulated in relevant logic (the proof for (...) number theory was obtained earlier by R. K. Meyer and suggested the present abstract development). (shrink)

In this paper we study proofs of some general forms of the Second Incompleteness Theorem. These forms conform to the Feferman format, where the proof predicate is fixed and the representation of the set of axioms varies. We extend the Feferman framework in one important point: we allow the interpretation of number theory to vary.

This paper concerns voting with logical consequences, which means that anybody voting for an alternative x should vote for the logical consequences of x as well. Similarly, the social choice set is also supposed to be closed under logical consequences. The central result of the paper is that, given a set of fairly natural conditions, the only social choice functions that satisfy social logical closure are oligarchic (where a subset of the voters are decisive for the social choice). The set (...) of conditions needed for the proof include a version of Independence of Irrelevant Alternatives that also plays a central role in Arrow's impossibility theorem. (Published Online July 11 2006) Footnotes1 Much of this article was written while the author was a fellow at the Swedish Collegium for Advanced Study in the Social Sciences (SCASSS) in Uppsala. I want to thank the Collegium for providing me with excellent working conditions. Wlodek Rabinowicz and other fellows gave me valuable comments at a seminar at SCASSS when an early version of the paper was presented. I also want to thank Luc Bovens, Franz Dietrich, Christian List and an anonymous referee for their excellent comments on a later version. The final version was prepared during a stay at Oxford University for which I am grateful to the British Academy. (shrink)

One might think that if the majority of virtue signallers judge that a proposition is true, then there is significant evidence for the truth of that proposition. Given the Condorcet Jury Theorem, individual virtue signallers need not be very reliable for the majority judgment to be very likely to be correct. Thus, even people who are skeptical of the judgments of individual virtue signallers should think that if a majority of them judge that a proposition is true, then that (...) provides significant evidence that the proposition is true. We argue that this is mistaken. Various empirical studies converge on the following point: humans are very conformist in the contexts in which virtue signalling occurs. And stereotypical virtue signallers are even more conformist in such contexts. So we should be skeptical of the claim that virtue signallers are sufficiently independent for the Condorcet Jury Theorem to apply. We do not seek to decisively rule out the relevant application of the Condorcet Jury Theorem. But we do show that careful consideration of the available evidence should make us very skeptical of that application. Consequently, a defense of virtue signalling would need to engage with these findings and show that despite our strong tendencies for conformism, our judgements are sufficiently independent for the Condorcet Jury Theorem to apply. This suggests new directions for the debate about the epistemology of virtue signalling. (shrink)

The proposition that a decreasing sequence of ordinals necessarily terminates has been given a new, and perhaps unexpected, importance by the rôle which it plays in Gentzen's proof of the freedom from contradiction of the “reine Zahlentheorie.” Gödel's construction of non-demonstrable propositions and the establishment of the impossibility of a proof of freedom from contradiction, within the framework of a certain type of formal system, showed that a proof of freedom from contradiction could be found only by transcending the axioms (...) and proof processes of that formal system. Gentzen's proof succeeds by utilisingtransfinite inductionto prove that certain sequences of reduction processes, enumerated by ordinals less than ε (the first ordinal to satisfy ε = ὡ) are finite. Were it possible to provethe restricted ordinal theorem, that a descending sequence of ordinals, less thanε, is finite, in Gentzen's “reine Zahlentheorie,” then it would be possible to determine a contradiction in that number system. In his paper, Gentzen proves the theorem of transfinite induction, which he requires, by an intuitive argument. There is also a method of reducing transfinite induction, for ordinals less than ε, to a number-theoretic principle given by Hilbert and Bernays, and a similar method by Ackermann. None of these proofs of transfinite induction isfinitist. (shrink)

The Lévy-Solovay Theorem [8] limits the kind of large cardinal embeddings that can exist in a small forcing extension. Here I announce a generalization of this theorem to a broad new class of forcing notions. One consequence is that many of the forcing iterations most commonly found in the large cardinal literature create no new weakly compact cardinals, measurable cardinals, strong cardinals, Woodin cardinals, strongly compact cardinals, supercompact cardinals, almost huge cardinals, huge cardinals, and so on.

This paper reconstructs and evaluates the representation theorem presented by Ramsey in his essay 'Truth and Probability', showing how its proof depends on a novel application of Hölder's theory of measurement. I argue that it must be understood as a solution to the problem of measuring partial belief, a solution that in many ways remains unsurpassed. Finally I show that the method it employs may be interpreted in such a way as to avoid a well known objection to it (...) due to Richard Jeffrey. (shrink)

A variation of Bell's theorem that deals with the indeterministic case is formulated and proved within the logical framework of Lewis's theory of counterfactuals. The no-faster-than-light-influence condition is expressed in terms of Lewis would counterfactual conditionals. Objections to this procedure raised by certain philosophers of science are examined and answered. The theorem shows that the incompatibility between the predictions of quantum theory and the idea of no faster-than-light influence cannot be ascribed to any auxiliary or tacit assumption of (...) either determinism or the related idea that outcomes of unperformed measurements are determinate within nature. In addition, the theorem provides an example of an application of Lewis's theory of counterfactuals in a rigorous scientific context. (shrink)

Since the validity of Bell's inequalities implies the existence of joint probabilities for non-commuting observables, there is no universal consensus as to what the violation of these inequalities signifies. While the majority view is that the violation teaches us an important lesson about the possibility of explanations, if not about metaphysical issues, there is also a minimalist position claiming that the violation is to be expected from simple facts about probability theory. This minimalist position is backed by theorems due to (...) A. Fine and I. Pitowsky.Our paper shows that the minimalist position cannot be sustained. To this end,we give a formally rigorous interpretation of joint probabilities in thecombined modal and spatiotemporal framework of `stochastic outcomes inbranching space-time' (SOBST) (Kowalski and Placek, 1999; Placek, 2000). We show in this framework that the claim that there can be no joint probabilities fornon-commuting observables is incorrect. The lesson from Fine's theorem is notthat Bell's inequalities will be violated anyhow, but that an adequate modelfor the Bell/aspect experiment must not define global joint probabilities. Thus we investigate the class of stochastic hidden variable models, whichprima facie do not define such joint probabilities. The reasonwhy these models fail supports the majority view: Bell's inequalities are notjust a mathematical artifact. (shrink)

Kripke-completeness of every classical modal logic with Sahlqvist formulas is one of the basic general results on completeness of classical modal logics. This paper shows a Sahlqvist theorem for modal logic over the relevant logic Bin terms of Routley- Meyer semantics. It is shown that usual Sahlqvist theorem for classical modal logics can be obtained as a special case of our theorem.

We prove that every countable non-standard model of WKL0 has a proper initial part isomorphic to itself. This theorem enables us to carry out non-standard arguments over WKL0.

May's theorem famously shows that, in social decisions between two options, simple majority rule uniquely satisfies four appealing conditions. Although this result is often cited in support of majority rule, it has never been extended beyond decisions based on pairwise comparisons of options. We generalize May's theorem to many-option decisions where voters each cast one vote. Surprisingly, plurality rule uniquely satisfies May's conditions. This suggests a conditional defense of plurality rule: If a society's balloting procedure collects only a (...) single vote from each voter, then plurality rule is the uniquely compelling electoral procedure. To illustrate the conditional nature of this claim, we also identify a richer informational environment in which approval voting, not plurality rule, is supported by a May-style argument. (shrink)

We propose a new schema for the deduction theorem and prove that the deductive system S of a prepositional logic L fulfills the proposed schema if and only if there exists a finite set A(p, q) of propositional formulae involving only prepositional letters p and q such that A(p, p) L and p, A(p, q) s q.

1.1 In 1955, John Harsanyi proved a remarkable theorem:1 Suppose n agents satisfy the assumptions of von Neumann/Morgenstern (1947) expected utility theory, and so does the group as a whole (or an observer). Suppose that, if each member of the group prefers option a to b, then so does the group, or the observer (Pareto condition). Then the group’s utility function is a weighted sum of the individual utility functions. Despite Harsanyi’s insistence that what he calls the Utilitarian (...) class='Hi'>Theorem embeds utilitarianism into a theory of rationality, the theorem has fallen short of having the kind of impact on the discussion of utilitarianism for which Harsanyi hoped. Yet how could the theorem influence this discussion? Utilitarianism is as attractive to some as it is appalling to others. The prospects for this dispute to be affected by a theorem seem dim. Yet a closer look shows how the theorem could make a contribution. To fix ideas, I understand by utilitarianism the following claims: (1) Consequentialism: Actions are evaluated in terms of their consequences only. (2) Bayesianism: An agent's beliefs about possible outcomes are captured probabilistically. (3) Welfarism: The judgement of the relative goodness of states of affairs is based.. (shrink)

One of the logic defined by Richard Epstein in a context of an analysis of subject matter relationship is Symmetric Relatedness Logic S. In the monograph [2] we can find some open problems concerning relatedness logic, a Post-style completeness theorem for logic S is one of them. Our paper introduces a solution of this metalogical issue.

Starting from a brief recapitulation of the contemporary debate on scientific realism, this paper argues for the following thesis : Assume a theory T has been empirically successful in a domain of application A, but was superseded later on by a superior theory T * , which was likewise successful in A but has an arbitrarily different theoretical superstructure. Then under natural conditions T contains certain theoretical expressions, which yielded T's empirical success, such that these T-expressions correspond (in A) to (...) certain theoretical expressions of T * , and given T * is true, they refer indirectly to the entities denoted by these expressions of T * . The thesis is first motivated by a study of the phlogiston–oxygen example. Then the thesis is proved in the form of a logical theorem , and illustrated by further examples. The final sections explain how the correspondence theorem justifies scientific realism and work out the advantages of the suggested account. Introduction: Pessimistic Meta-induction vs. Structural Correspondence The Case of the Phlogiston Theory Steps Towards a Systematic Correspondence Theorem The Correspondence Theorem and Its Ontological Interpretation Further Historical Applications Discussion of the Correspondence Theorem: Objections and Replies Consequences for Scientific Realism and Comparison with Other Positions 7.1 Comparison with constructive empiricism 7.2 Major difference from standard scientific realism 7.3 From minimal realism and correspondence to scientific realism 7.4 Comparison with particular realistic positions CiteULike Connotea Del.icio.us What's this? (shrink)

I apply some of the lessons from quantum theory, in particular from Bell’s theorem, to a debate on the foundations of decision theory and causation. By tracing a formal analogy between the basic assumptions of causal decision theory (CDT)—which was developed partly in response to Newcomb’s problem— and those of a local hidden variable theory in the context of quantum mechanics, I show that an agent who acts according to CDT and gives any nonzero credence to some possible causal (...) interpretations underlying quantum phenomena should bet against quantum mechanics in some feasible game scenarios involving entangled systems, no matter what evidence they acquire. As a consequence, either the most accepted version of decision theory is wrong, or it provides a practical distinction, in terms of the prescribed behaviour of rational agents, between some metaphysical hypotheses regarding the causal structure underlying quantum mechanics. (shrink)

David Lewis' "Principal Principle" is a purported principle of rationality connecting credence and objective chance. Almost all of the discussion of the Principal Principle in the philosophical literature assumes classical probability theory, which is unfortunate since the theory of modern physics that, arguably, speaks most clearly of objective chance is the quantum theory, and quantum probabilities are not classical probabilities. Given the generally accepted updating rule for quantum probabilities, there is a straight forward sense in which the Principal Principle is (...) a theorem of quantum probability theory for any credence function satisfying a suitable additivity requirement. No additional principle of rationality is needed to bring credence into line with objective chance. (shrink)

Hirst investigated a natural restriction of Hindman’s Finite Sums Theorem—called Hilbert’s Theorem—and proved it equivalent over \ to the Infinite Pigeonhole Principle for all colors. This gave the first example of a natural restriction of Hindman’s Theorem provably much weaker than Hindman’s Theorem itself. We here introduce another natural restriction of Hindman’s Theorem—which we name the Adjacent Hindman’s Theorem with apartness—and prove it to be provable from Ramsey’s Theorem for pairs and strictly stronger (...) than Hirst’s Hilbert’s Theorem. The lower bound is obtained by a direct combinatorial implication from the Adjacent Hindman’s Theorem with apartness to the Increasing Polarized Ramsey’s Theorem for pairs introduced by Dzhafarov and Hirst. In the Adjacent Hindman’s Theorem homogeneity is required only for finite sums of adjacent elements. (shrink)

Though deceptively simple and plausible on the face of it, Craig's interpolation theorem has proved to be a central logical property that has been used to reveal a deep harmony between the syntax and semantics of first order logic. Craig's theorem was generalized soon after by Lyndon, with application to the characterization of first order properties preserved under homomorphism. After retracing the early history, this article is mainly devoted to a survey of subsequent generalizations and applications, especially of (...) many-sorted interpolation theorems. Attention is also paid to methodological considerations, since the Craig theorem and its generalizations were initially obtained by proof-theoretic arguments while most of the applications are model-theoretic in nature. The article concludes with the role of the interpolation property in the quest for "reasonable" logics extending first-order logic within the framework of abstract model theory. (shrink)

Tennenbaum's Theorem yields an elegant characterisation of the standard model of arithmetic. Several authors have recently claimed that this result has important philosophical consequences: in particular, it offers us a way of responding to model-theoretic worries about how we manage to grasp the standard model. We disagree. If there ever was such a problem about how we come to grasp the standard model, then Tennenbaum's Theorem does not help. We show this by examining a parallel argument, from a (...) simpler model-theoretic result. (shrink)