We propose a natural definition of what it means in a constructive context for a Banach space to be reflexive, and then prove a constructive counterpart of the Milman-Pettis theorem that uniformly convex Banach spaces are reflexive.

Let B be a p-uniformly convex Banach space, with p≥2. Let T be a linear operator on B, and let Anx denote the ergodic average ∑i.

We show constructively that every quasi-convex, uniformly continuous function \ with at most one minimum point has a minimum point, where C is a convex compact subset of a finite dimensional normed space. Applications include a result on strictly quasi-convex functions, a supporting hyperplane theorem, and a short proof of the constructive fundamental theorem of approximation theory.

Two classically equivalent, but constructively inequivalent, strict convexity properties of a preference relation are discussed, and conditions given under which the stronger notion is a consequence of the weaker. The last part of the paper introduces uniformly rotund preferences, and shows that uniform rotundity implies strict convexity. The paper is written from a strictly constructive point of view, in which all proofs embody algorithms. MSC: 03F60, 90A06.

The main result of this paper is a weak constructive version of the uniform continuity theorem for pointwise continuous, real-valued functions on a convex subset of a normed linear space. Recursive examples are given to show that the hypotheses of this theorem are necessary. The remainder of the paper discusses conditions which ensure that a sequentially continuous function is continuous. MSC: 03F60, 26E40, 46S30.

We work in set theory ZF without axiom of choice. Though the Hahn-Banach theorem cannot be proved in ZF, we prove that every Gateaux-differentiable uniformly convex Banach space E satisfies the following continuous Hahn-Banach property: if p is a continuous sublinear functional on E, if F is a subspace of E, and if f: F → ℝ is a linear functional such that f ≤ p|F then there exists a linear functional g : E → ℝ such that (...) g extends f and g ≤ p. We also prove that the continuous Hahn-Banach property on a topological vector space E is equivalent to the classical geometrical forms of the Hahn-Banach theorem on E. We then prove that the axiom of Dependent choices DC is equivalent to Ekeland's variational principle, and that it implies the continuous Hahn-Banach property on Gateaux-differentiable Banach spaces. Finally, we prove that, though separable normed spaces satisfy the continuous Hahn-Banach property, they do not satisfy the whole Hahn-Banach property in ZF+DC. (shrink)

We work in set theory without the Axiom of Choice ZF. We prove that the Principle of Dependent Choices (DC) implies that the closed unit ball of a uniformly convex Banach space is weakly compact and, in particular, that the closed unit ball of a Hilbert space is weakly compact. These statements are not provable in ZF and the latter statement does not imply DC. Furthermore, DC does not imply that the closed unit ball of a reflexive space (...) is weakly compact. (shrink)

We obtain an equivalent implicit characterization of Lp Banach spaces that is amenable to a logical treatment. Using that, we obtain an axiomatization for such spaces into a higher order logical system, the kind of which is used in proof mining, a research program that aims to obtain the hidden computational content of mathematical proofs using tools from mathematical logic. As an aside, we obtain a concrete way of formalizing Lp spaces in positive-bounded logic. The axiomatization is followed by a (...) corresponding metatheorem in the style of proof mining. We illustrate its use with the derivation for this class of spaces of the standard modulus of uniform convexity. (shrink)

We discuss computability properties of the set of elements of best approximation of some point xX by elements of GX in computable Banach spaces X. It turns out that for a general closed set G, given by its distance function, we can only obtain negative information about as a closed set. In the case that G is finite-dimensional, one can compute negative information on as a compact set. This implies that one can compute the point in whenever it is uniquely (...) determined. This is also possible for a wider class of subsets G, given that one imposes additionally convexity properties on the space. If the Banach space X is computably uniformly convex and G is convex, then one can compute the uniquely determined point in . We also discuss representations of finite-dimensional subspaces of Banach spaces and we show that a basis representation contains the same information as the representation via distance functions enriched by the dimension. Finally, we study computability properties of the dimension and the codimension map and we show that for finite-dimensional spaces X the dimension is computable, given the distance function of the subspace. (shrink)

We describe a particular class of pairs of quantum observables which are extremal in the convex set of all pairs of compatible quantum observables. The pairs in this class are constructed as uniformly noisy versions of two mutually unbiased bases with possibly different noise intensities affecting each basis. We show that not all pairs of MUB can be used in this construction, and we provide a criterion for determining those MUB that actually do yield extremal compatible observables. We (...) apply our criterion to all pairs of Fourier conjugate MUB, and we prove that in this case extremality is achieved if and only if the quantum system Hilbert space is odd-dimensional. Remarkably, this fact is no longer true for general non-Fourier conjugate MUB, as we show in an example. Therefore, the presence or the absence of extremality is a concrete geometric manifestation of MUB inequivalence, that already materializes by comparing sets of no more than two bases at a time. (shrink)

For regular sets in Euclidean space, previous work has identified twelve ‘basic’ computability notions to which many previous notions considered in literature were shown to be equivalent. With respect to those basic notions we now investigate on the computability of natural operations on regular sets: union, intersection, complement, convex hull, image, and pre-image under suitable classes of functions. It turns out that only few of these notions are suitable in the sense of rendering all those operations uniformly computable.

John Locke:When we set before our eyes a round globe of uniform colour, v.g. gold, alabaster or jet, it is certain that the idea thereby imprinted in our mind is of a flat circle, variously shadowed, with several degrees of light and brightness coming to our eyes. But we having, by use, been accustomed to perceive what kind of appearance convex bodies are wont to make in us, what alterations are made in the reflections of light by the difference (...) of the sensible figures of bodies: the judgment presently, by an habitual custom, alters the appearances into their causes.H.H. Price:…. a distant hillside which is full of protuberances, and slopes upwards at quite a gentle angle, will appear flat and vertical….. This means that the sense-datum, the colour expanse which we sense, actually is flat and vertical. (shrink)

John Locke:When we set before our eyes a round globe of uniform colour, v.g. gold, alabaster or jet, it is certain that the idea thereby imprinted in our mind is of a flat circle, variously shadowed, with several degrees of light and brightness coming to our eyes. But we having, by use, been accustomed to perceive what kind of appearance convex bodies are wont to make in us, what alterations are made in the reflections of light by the difference (...) of the sensible figures of bodies: the judgment presently, by an habitual custom, alters the appearances into their causes.H.H. Price:…. a distant hillside which is full of protuberances, and slopes upwards at quite a gentle angle, will appear flat and vertical….. This means that the sense-datum, the colour expanse which we sense, actually is flat and vertical. (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)

Let X be a non-reflexive Banach space such that X ∗ is separable. Let N be the set of all equivalent norms on X , equipped with the topology of uniform convergence on bounded subsets of X . We show that the subset Z of N consisting of Fréchet-differentiable norms whose dual norm is not strictly convex reduces any difference of analytic sets. It follows that Z is exactly a difference of analytic sets when N is equipped with the (...) standard Effros–Borel structure. Our main lemma elucidates the topological structure of the norm-attaining linear forms when the norm of X is locally uniformly rotund. (shrink)

We consider a one-dimensional translation invariant point process of density one with uniformly bounded variance of the number NI of particles in any interval I. Despite this suppression of fluctuations we obtain a large deviation principle with rate function F(ρ) −L−1 log Prob(ρ) for observing a macroscopic density profile ρ(x), x ∈ [0, 1], corresponding to the coarse-grained and rescaled density of the points of the original process in an interval of length L in the limit L → ∞. (...) F(ρ) is not convex and is discontinuous at ρ ≡ 1, the typical profile. (shrink)

Let T be a complete o-minimal extension of the theory of real closed fields. We characterize the convex hulls of elementary substructures of models of T and show that the residue field of such a convex hull has a natural expansion to a model of T. We give a quantifier elimination relative to T for the theory of pairs (R, V) where $\mathscr{R} \models T$ and V ≠ R is the convex hull of an elementary substructure of (...) R. We deduce that the theory of such pairs is complete and weakly o-minimal. We also give a quantifier elimination relative to T for the theory of pairs (R, N) with R a model of T and N a proper elementary substructure that is Dedekind complete in R. We deduce that the theory of such "tame" pairs is complete. (shrink)

This paper introduces a logical analysis of convex combinations within the framework of Łukasiewicz real-valued logic. This provides a natural link between the fields of many-valued logics and decision theory under uncertainty, where the notion of convexity plays a central role. We set out to explore such a link by defining convex operators on MV-algebras, which are the equivalent algebraic semantics of Łukasiewicz logic. This gives us a formal language to reason about the expected value of bounded random (...) variables. As an illustration of the applicability of our framework we present a logical version of the Anscombe–Aumann representation result. (shrink)

Convexity predicates and the convex hull operator continue to play an important role in theories of spatial representation and reasoning, yet their first-order axiomatization is still a matter of controversy. In this paper, we present a new approach to adding convexity to mereotopological theory with boundary elements by specifying first-order axioms for a binary segment operator s. We show that our axioms yields a convex hull operator h that supports, not only the basic properties of convex regions, (...) but also complex properties concerning region alignment. We also argue that h is stronger than convex hull operators from existing axiomatizations and show how to derive the latter from our axioms for s. (shrink)

I solve here some problems left open in “T-convexity and Tame Extensions” [9]. Familiarity with [9] is assumed, and I will freely use its notations. In particular,Twill denote a completeo-minimal theory extending RCF, the theory of real closed fields. Let (,V) ⊨Tconvex, let=V/m(V)be the residue field, with residue class mapx↦:V↦, and let υ:→ Γ be the associated valuation. “Definable” will mean “definable with parameters”.The main goal of this article is to determine the structure induced by(,V)on its residue fieldand on its (...) value group Γ. In [9] we expanded the ordered fieldto a model ofTas follows. Take a tame elementary substructure′ ofsuch thatR′ ⊆VandR′maps bijectively ontounder the residue class map, and make this bijection into an isomorphism′ ≌ofT-models. (We showed such′ exists, and that this gives an expansion ofto aT-model that is independent of the choice of′.). (shrink)

The notion of conceptual space, proposed by Gärdenfors as a framework for the representation of concepts and knowledge, has been highly influential over the last decade or so. One of the main theses involved in this approach is that the conceptual regions associated with properties, concepts, verbs, etc. are convex. The aim of this paper is to show that such a constraint—that of the convexity of the geometry of conceptual regions—is problematic; both from a theoretical perspective and with regard (...) to the inner workings of the theory itself. On the one hand, all the arguments provided in favor of the convexity of conceptual regions rest on controversial assumptions. Additionally, his argument in support of a Euclidean metric, based on the integral character of conceptual dimensions, is weak, and under non-Euclidean metrics the structure of regions may be non-convex. Furthermore, even if the metric were Euclidean, the convexity constraint could be not satisfied if concepts were differentially weighted. On the other hand, Gärdenfors’ convexity constraint is brought into question by the own inner workings of conceptual spaces because: some of the allegedly convex properties of concepts are not convex; the conceptual regions resulting from the combination of convex properties can be non-convex; convex regions may co-vary in non-convex ways; and his definition of verbs is incompatible with a definition of properties in terms of convex regions. Therefore, the mandatory character of the convexity requirement for regions in a conceptual space theory should be reconsidered. (shrink)

I solve here some problems left open in “T-convexity and Tame Extensions” [9]. Familiarity with [9] is assumed, and I will freely use its notations. In particular,Twill denote a completeo-minimal theory extending RCF, the theory of real closed fields. Let (,V) ⊨Tconvex, let=V/m(V)be the residue field, with residue class mapx↦:V↦, and let υ:→ Γ be the associated valuation. “Definable” will mean “definable with parameters”.The main goal of this article is to determine the structure induced by(,V)on its residue fieldand on its (...) value group Γ. In [9] we expanded the ordered fieldto a model ofTas follows. Take a tame elementary substructure′ ofsuch thatR′ ⊆VandR′maps bijectively ontounder the residue class map, and make this bijection into an isomorphism′ ≌ofT-models. (We showed such′ exists, and that this gives an expansion ofto aT-model that is independent of the choice of′.). (shrink)

This paper defines the form of prior knowledge that is required for sound inferences by analogy and single-instance generalizations, in both logical and probabilistic reasoning. In the logical case, the first order determination rule defined in Davies (1985) is shown to solve both the justification and non-redundancy problems for analogical inference. The statistical analogue of determination that is put forward is termed 'uniformity'. Based on the semantics of determination and uniformity, a third notion of "relevance" is defined, both logically and (...) probabilistically. The statistical relevance of one function in determining another is put forward as a way of defining the value of information: The statistical relevance of a function F to a function G is the absolute value of the change in one's information about the value of G afforded by specifying the value of F. This theory provides normative justifications for conclusions projected by analogy from one case to another, and for generalization from an instance to a rule. The soundness of such conclusions, in either the logical or the probabilistic case, can be identified with the extent to which the corresponding criteria (determination and uniformity) actually hold for the features being related. (shrink)

Economic theory has generally acknowledged the role that institutions have in shaping economic space. The distinction, however, between physical and institutional descriptions of economic activity has not received adequate attention within the mainstream paradigm. In this paper I show how a proper distinction between the physical and institutional space in economic models will help clarify the concept of externality and provide a better interpretation of the relationship between externality and nonconvexity. I argue that within the Arrow-Debreu framework externality should be (...) viewed as incongruence between the physical and institutional descriptions of the economic space. I also argue that, contrary to conventional wisdom, detrimental externality has no special association with nonconvexity. Starrett's (1972) fundamental nonconvexity has to do with the specific institutional structure of Arrow markets rather than the detrimental nature of externality. Indeed, Arrow markets may not eliminate externalities. In a similar vein, it is not detrimental externality, however intense, that causes the production possibility set to become nonconvex, as argued by Baumol and Bradford (1972), but the particular interpretation of intensity that would make even conventional production possibility sets nonconvex. These points become apparent when one distinguishes between the convexity of the physical and institutional production sets. (shrink)

This paper deals with decision makers who choose among information systems. It shows that the properties of Schur convexity and of quasi-convexity are equivalent, even when general preferences are considered. Since Schur convexity is closely related to having a willingness to accept information and since quasi-convexity is closely related to having a preference for early resolution of the uncertainty about which information system prevails, then it follows that the equivalence implies that decision makers prefer more information to less if, and (...) only if, they prefer early resolution of uncertainty to later resolution. (shrink)

A uniform theory of conditionals is one which compositionally captures the behavior of both indicative and subjunctive conditionals without positing ambiguities. This paper raises new problems for the closest thing to a uniform analysis in the literature (Stalnaker, Philosophia, 5, 269–286 (1975)) and develops a new theory which solves them. I also show that this new analysis provides an improved treatment of three phenomena (the import-export equivalence, reverse Sobel-sequences and disjunctive antecedents). While these results concern central issues in the study (...) of conditionals, broader themes in the philosophy of language and formal semantics are also engaged here. This new analysis exploits a dynamic conception of meaning where the meaning of a symbol is its potential to change an agent’s mental state (or the state of a conversation) rather than being the symbol’s content (e.g. the proposition it expresses). The analysis of conditionals is also built on the idea that the contrast between subjunctive and indicative conditionals parallels a contrast between revising and consistently extending some body of information. (shrink)

Let ℋ be a finite-dimensional complex Hilbert space and D the set of density matrices on ℋ, i.e., the positive operators with trace 1. Our goal in this note is to identify a probability measure u on D that can be regarded as the uniform distribution over D. We propose a measure on D, argue that it can be so regarded, discuss its properties, and compute the joint distribution of the eigenvalues of a random density matrix distributed according to this (...) measure. (shrink)

We investigate risk associated with the violation of a constraint, which is desirable but hardly satisfiable in all possible states of nature.

The model of incomplete cooperative games incorporates uncertainty into the classical model of cooperative games by considering a partial characteristic function. Thus the values for some of the coalitions are not known. The main focus of this paper is 1-convexity under this framework. We are interested in two heavily intertwined questions. First, given an incomplete game, how can we fill in the missing values to obtain a complete 1-convex game? Second, how to determine in a rational, fair, and efficient (...) way the payoffs of players based only on the known values of coalitions? We illustrate the analysis with two classes of incomplete games—minimal incomplete games and incomplete games with defined upper vector. To answer the first question, for both classes, we provide a description of the set of 1-convex extensions in terms of its extreme points and extreme rays. Based on the description of the set of 1-convex extensions, we introduce generalisations of three solution concepts for complete games, namely the τ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau $$\end{document}-value, the Shapley value and the nucleolus. For minimal incomplete games, we show that all of the generalised values coincide. We call it the average value and provide different axiomatisations. For incomplete games with defined upper vector, we show that the generalised values do not coincide in general. This highlights the importance and also the difficulty of considering more general classes of incomplete games. (shrink)

This chapter contains sections titled: Categorical Prescriptiveness Uniformity as a Moral Matter Uniformity Contrasted with Neutrality The Overridingness of Moral Principles.

Natural languages vary in their quantity expressions, but the variation seems to be constrained by general properties, so-calleduniversals. Their explanations have been sought among constraints of human cognition, communication, complexity, and pragmatics. In this article, we apply a state-of-the-art language coordination model to the semantic domain of quantities to examine whether two quantity universals—monotonicity and convexity—arise as a result of coordination. Assuming precise number perception by the agents, we evolve communicatively usable quantity terminologies in two separate conditions: a numeric-based condition (...) in which agents communicate about a number of objects and a quotient-based condition in which agents communicate about the proportions. We find out that both universals take off in all conditions but only convexity almost entirely dominates the emergent languages. Additionally, we examine whether the perceptual constraints of the agents can contribute to the further development of universals. We compare the degrees of convexity and monotonicity of languages evolving in populations of agents with precise and approximate number sense. The results suggest that approximate number sense significantly reinforces monotonicity and leads to further enhancement of convexity. Last but not least, we show that the properties of the evolved quantifiers match certain invariance properties from generalized quantifier theory. (shrink)

The pessimistic induction is built upon the uniformity principle that the future resembles the past. In daily scientific activities, however, scientists sometimes rely on what I call the disuniformity principle that the future differs from the past. They do not give up their research projects despite the repeated failures. They believe that they will succeed although they failed repeatedly, and as a result they achieve what they intended to achieve. Given that the disuniformity principle is useful in certain cases in (...) science, we might reasonably use it to infer that present theories are true unlike past theories. Hence, pessimists have the burden to show that our prediction about the fate of present theories is more likely to be true if we use the uniformity principle than if we use the disuniformity principle. (shrink)

Let T be a complete o-minimal extension of the theory of real closed fields. We characterize the convex hulls of elementary substructures of models of T and show that the residue field of such a convex hull has a natural expansion to a model of T. We give a quantifier elimination relative to T for the theory of pairs (R, V) where $\mathscr{R} \models T$ and V ≠ R is the convex hull of an elementary substructure of (...) R. We deduce that the theory of such pairs is complete and weakly o-minimal. We also give a quantifier elimination relative to T for the theory of pairs (R, N) with R a model of T and N a proper elementary substructure that is Dedekind complete in R. We deduce that the theory of such "tame" pairs is complete. (shrink)

We deal with ontological problems concerning basic systems of explicit mathematics, as formalized in Jager's language of types and names. We prove a generalized inseparability lemma, which implies a form of Rice's theorem for types and a refutation of the strong power type axiom POW$^+$. Next, we show that POW$^+$ can already be refuted on the basis of a weak uniform comprehension without complementation, and we present suitable optimal refinements of the remaining results within the weaker theory.

Allen, B., Arithmetizing Uniform NC, Annals of Pure and Applied Logic 53 1–50. We give a characterization of the complexity class Uniform NC as an algebra of functions on the natural numbers which is the closure of several basic functions under composition and a schema of recursion. We then define a fragment of bounded arithmetic, and, using our characterization of Uniform NC, show that this fragment is capable of proving the totality of all of the functions in Uniform NC. Lastly, (...) in the spirit of Buss, we show that any function which is definable by a ∑b1-formula in our theory is a function which is in Uniform NC. (shrink)

We give a definition, in the ring language, of Zp inside Qp and of Fp[[t]] inside Fp), which works uniformly for all p and all finite field extensions of these fields, and in many other Henselian valued fields as well. The formula can be taken existential-universal in the ring language, and in fact existential in a modification of the language of Macintyre. Furthermore, we show the negative result that in the language of rings there does not exist a uniform (...) definition by an existential formula and neither by a universal formula for the valuation rings of all the finite extensions of a given Henselian valued field. We also show that there is no existential formula of the ring language defining Zp inside Qp uniformly for all p. For any fixed finite extension of Qp, we give an existential formula and a universal formula in the ring language which define the valuation ring. (shrink)

Gärdenfors (Conceptual spaces, 2000) argues that the semantic domains that natural language deals with have a geometrical structure. He gives evidence that simple natural language adjectives usually denote natural properties, where a natural property is a convex region of such a “conceptual space.” In this paper I will show that this feature of natural categories need not be stipulated as basic. In fact, it can be shown to be the result of evolutionary dynamics of communicative strategies under very general (...) assumptions. (shrink)

Uniformism about the epistemology of modality is the view that there is only one basic route to modal knowledge; non-uniformism is the view that there are several. Non-uniformism is becoming an increasingly popular stance, but how can it be defended? I prise apart two ways of understanding the uniformism/non-uniformism conflict that are mixed up in the literature. I argue that once separated, it is evident that they lead up to two different non-uniformist theses that need to be argued for in (...) very different ways. In particular, one construal allows only for a weak thesis about the actual lay of the current theoretical land in modal epistemology, while the other allows for a strong thesis that can be defended without reliance on claims about the alleged goodness or badness of individual accounts of modal justification. I argue that philosophers inclined towards non-uniformism ought to go for the strong, rather than the weak, thesis. (shrink)

Can rational communication proceed when interlocutors are uncertain which contents utterances contribute to discourse? An influential negative answer to this question is embodied in the Stalnakerian principle of uniformity, which requires speakers to produce only utterances that express the same content in every possibility treated as live for the purposes of the conversation. The principle of uniformity enjoys considerable intuitive plausibility and, moreover, seems to follow from platitudes about assertion; nevertheless, it has recently proven controversial. In what follows, I defend (...) the principle by developing two arguments for it based on premises reflecting the central aims and assumptions of possibility-carving frameworks for modeling inquiry—that is, frameworks which describe the evolution of individuals’ attitudinal states in terms of set-theoretic operations defined over a domain of objects representing possibilities. (shrink)

In this paper, a proof-theoretic method to prove uniform Lyndon interpolation for non-normal modal logics is introduced and applied to show that the logics E\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {E}$$\end{document}, M\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {M}$$\end{document}, MC\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {MC}$$\end{document}, EN\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {EN}$$\end{document}, MN\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {MN}$$\end{document} have that (...) property. In particular, these logics have uniform interpolation. Although for some of them the latter is known, the fact that they have uniform Lyndon interpolation is new. Also, the proof-theoretic proofs of these facts are new, as well as the constructive way to explicitly compute the interpolants that they provide. It is also shown that the non-normal modal logics EC\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {EC}$$\end{document} and ECN\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {ECN}$$\end{document} do not have Craig interpolation, and whence no uniform interpolation. (shrink)

In this paper, we propose a new concept named the uniform single valued neutrosophic graph. An illustrative example and some properties are examined. Next, we develop an algorithmic approach for computing the complement of the single valued neutrosophic graph. A numerical example is demonstrated for computing the complement of single valued neutrosophic graphs and uniform single valued neutrosophic graph.

We investigate uniform interpolants in propositional modal logics from the proof-theoretical point of view. Our approach is adopted from Pitts’ proof of uniform interpolationin intuitionistic propositional logic [15]. The method is based on a simulation of certain quantifiers ranging over propositional variables and uses a terminating sequent calculus for which structural rules are admissible.

This paper presents a uniform general account of regress problems in the form of a pentalemma—i.e., a set of five mutually inconsistent claims. Specific regress problems can be analyzed as instances of such a general schema, and this Regress Pentalemma Schema can be employed to generate deductively valid arguments from the truth of a subset of four claims to the falsity of the fifth. Thus, a uniform account of the nature of regress problems allows for an improved understanding of specific (...) regress objections or arguments, and, correspondingly, of the general logical geography of the debate about infinite regresses. This uniform approach is illustrated by a treatment of the classical epistemological problem of justification, but it encompasses a whole variety of cases including explanation and ontological grounding. Furthermore, this general account is compared and contrasted with the existing literature discussing argument schemata for regress objections, particularly with the work of Jan Willem Wieland. It is shown how such other schemata can be incorporated and superseded by the general Regress Pentalemma Schema. (shrink)

Chris Heathwood requires the sentence 'Caesar was conscious when he crossed the Rubicon' to be made true in much the same way as 'Caesar was wet when he crossed the Rubicon'. Yet because the Growing Block theorist is committed to the zombiedom of the past,the former is not made true by past objects, although the latter is. Heathwood demands a uniform account of the grounding of truths and he will be given a uniform account. But we should exercise care in (...) deciding just what sort of uniformity is appropriate. As Russell so famously pointed out a century ago the subject/predicate form of a sentence can be misleading. Likewise although the two sentences 'Caesar is conscious' and 'Caesar is wet' have similar subject/predicate forms they have, I say, different kinds of truth-conditions and hence their past tense transformations also have different kinds of truth-conditions. The uniformity I endorse is that in both cases the grounds for the past tense transformation are the same as the grounds the present tense versions used to have when they were true. (shrink)