In this paper, we investigate the expressiveness of the variety of propositional interval neighborhood logics , we establish their decidability on linearly ordered domains and some important subclasses, and we prove the undecidability of a number of extensions of PNL with additional modalities over interval relations. All together, we show that PNL form a quite expressive and nearly maximal decidable fragment of Halpern–Shoham’s interval logic HS.

We survey main developments, results, and open problems on interval temporal logics and duration calculi. We present various formal systems studied in the literature and discuss their distinctive features, emphasizing on expressiveness, axiomatic systems, and (un)decidability results.

In this paper we focus our attention on tableau methods for propositional interval temporal logics. These logics provide a natural framework for representing and reasoning about temporal properties in several areas of computer science. However, while various tableau methods have been developed for linear and branching time point-based temporal logics, not much work has been done on tableau methods for interval-based ones. We develop a general tableau method for Venema's \cdt\ logic interpreted over partial orders (...) (\nsbcdt\ for short). It combines features of the classical tableau method for first-order logic with those of explicit tableau methods for modal logics with constraint label management, and it can be easily tailored to most propositional interval temporal logics proposed in the literature. We prove its soundness and completeness, and we show how it has been implemented. (shrink)

Darwiche and Pearl’s seminal 1997 article outlined a number of baseline principles for a logic of iterated belief revision. These principles, the DP postulates, have been supplemented in a number of alternative ways. Most suggestions have resulted in a form of ‘reductionism’ that identifies belief states with orderings of worlds. However, this position has recently been criticised as being unacceptably strong. Other proposals, such as the popular principle (P), aka ‘Independence’, characteristic of ‘admissible’ operators, remain commendably more modest. In this (...) paper, we supplement the DP postulates and (P) with a number of novel conditions. While the DP postulates constrain the relation between a prior and a posterior conditional belief set, our new principles notably govern the relation between two posterior conditional belief sets obtained from a common prior by different revisions. We show that operators from the resulting family, which subsumes both lexicographic and restrained revision, can be represented as relating belief states associated with a ‘proper ordinal interval’ (POI) assignment, a structure more fine-grained than a simple ordering of worlds. We close the paper by noting that these operators satisfy iterated versions of many AGM era postulates, including Superexpansion, that are not sound for admissible operators in general. (shrink)

A logic of intervals is proposed akin to the one published by Hamblin (Hamblin (1969) and (1971)). Like Hamblin's, the present system is also based on a single primitive. However, the work presented here differs from Hamblin's in a number of respects. Most importantly, the present system is explicitly based on mereological ideas in such a way that not only are the two notions of abutment and temporal order involved in Hamblin's primitive two-place relation "abuts at the earlier end" distinguished (...) ; the temporal ordering itself is built up from a symmetric mereological primitive. The present system is shown to be complete. (shrink)

One of the most expected properties of a logical system is that it can be algebraizable, in the sense that an algebraic counterpart of the deductive machinery could be found. Since the inception of da Costa's paraconsistent calculi, an algebraic equivalent for such systems have been searched. It is known that these systems are non self-extensional (i.e., they do not satisfy the replacement property). More than this, they are not algebraizable in the sense of Blok-Pigozzi. The same negative results hold (...) for several systems of the hierarchy of paraconsistent logics known as Logics of Formal Inconsistency (LFIs). Because of this, these logics are uniquely characterized by semantics of non-deterministic kind. This paper offers a solution for two open problems in the domain of paraconsistency, in particular connected to algebraization of LFIs, by obtaining several LFIs weaker than C1, each of one is algebraizable in the standard Lindenbaum-Tarski's sense by a suitable variety of Boolean algebras extended with operators. This means that such LFIs satisfy the replacement property. The weakest LFI satisfying replacement presented here is called RmbC, which is obtained from the basic LFI called mbC. Some axiomatic extensions of RmbC are also studied, and in addition a neighborhood semantics is defined for such systems. It is shown that RmbC can be defined within the minimal bimodal non-normal logic E+E defined by the fusion of the non-normal modal logic E with itself. Finally, the framework is extended to first-order languages. RQmbC, the quantified extension of RmbC, is shown to be sound and complete w.r.t. BALFI semantics. (shrink)

Neutrosophy has been introduced some years ago by Florentin Smarandache as a new branch of philosophy dealing with “the origin, nature and scope of neutralities, as well as their interactions with different ideational spectra”. A variety of new theories have been developed on the basic principles of neutrosophy: among them is neutrosophic logics, a family of many-valued systems that can be regarded as a generalization of fuzzy logics. In this paper we present a critical introduction to neutrosophic (...) class='Hi'>logics, focusing on the problem of defining suitable neutrosophic propositional connectives and discussing the relationship between neutrosophic logics and other well-known frameworks for reasoning with uncertainty and vagueness, such as (intuitionistic and interval-valued) fuzzy systems and Belnap’s logic. (shrink)

Neutrosophic Over-/Under-/Off-Set and -Logic were defined for the first time by Smarandache in 1995 and published in 2007. They are totally different from other sets/logics/probabilities. He extended the neutrosophic set respectively to Neutrosophic Overset {when some neutrosophic component is > 1}, Neutrosophic Underset {when some neutrosophic component is < 0}, and to Neutrosophic Offset {when some neutrosophic components are off the interval [0, 1], i.e. some neutrosophic component > 1 and other neutrosophic component < 0}. This is no (...) surprise with respect to the classical fuzzy set/logic, intuitionistic fuzzy set/logic, or classical/imprecise probability, where the values are not allowed outside the interval [0, 1], since our real-world has numerous examples and applications of over-/under-/off-neutrosophic components. (shrink)

In this article we provide a mathematical model of Kant?s temporal continuum that satisfies the (not obviously consistent) synthetic a priori principles for time that Kant lists in the Critique of pure Reason (CPR), the Metaphysical Foundations of Natural Science (MFNS), the Opus Postumum and the notes and frag- ments published after his death. The continuum so obtained has some affinities with the Brouwerian continuum, but it also has ‘infinitesimal intervals’ consisting of nilpotent infinitesimals, which capture Kant’s theory of rest (...) and motion in MFNS. While constructing the model, we establish a concordance between the informal notions of Kant?s theory of the temporal continuum, and formal correlates to these notions in the mathematical theory. Our mathematical reconstruction of Kant?s theory of time allows us to understand what ?faculties and functions? must be in place for time to satisfy all the synthetic a priori principles for time mentioned. We have presented here a mathematically precise account of Kant?s transcendental argument for time in the CPR and of the rela- tion between the categories, the synthetic a priori principles for time, and the unity of apperception; the most precise account of this relation to date. We focus our exposition on a mathematical analysis of Kant’s informal terminology, but for reasons of space, most theorems are explained but not formally proven; formal proofs are available in (Pinosio, 2017). The analysis presented in this paper is related to the more general project of developing a formalization of Kant’s critical philosophy (Achourioti & van Lambalgen, 2011). A formal approach can shed light on the most controversial concepts of Kant’s theoretical philosophy, and is a valuable exegetical tool in its own right. However, we wish to make clear that mathematical formalization cannot displace traditional exegetical methods, but that it is rather an exegetical tool in its own right, which works best when it is coupled with a keen awareness of the subtleties involved in understanding the philosophical issues at hand. In this case, a virtuous ?hermeneutic circle? between mathematical formalization and philosophical discourse arises. (shrink)

We consider a basic logic with two primitive uni-modal operators: one for certainty and the other for plausibility. The former is assumed to be a normal operator, while the latter is merely a classical operator. We then define belief, interpreted as “maximally plausible possibility”, in terms of these two notions: the agent believes \ if she cannot rule out \ ), she judges \ to be plausible and she does not judge \ to be plausible. We consider four interaction properties (...) between certainty and plausibility and study how these properties translate into properties of belief. We then prove that all the logics considered are minimal logics for the highlighted theorems. We also consider a number of possible interpretations of plausibility, identify the corresponding logics and show that some notions considered in the literature are special cases of our framework. (shrink)

This paper aims to achieve a better understanding of what Socrates means by “sumfvne›n” in the sections of the Phaedo in which he uses the word, and how its use contributes both to the articulation of the hypothetical method and the proof of the soul’s immortality. Section I sets out the well-known problems for the most obvious readings of the relation, while Sections II and III argue against two remedies for these problems, the first an interpretation of what the sumfvne› (...) n relation consists in, the second an interpretation of what sorts of thing the relation is meant to relate. My positive account in Section IV argues that we should take the musical connotations of the term seriously, and that Plato was thinking of a robust analogy between the way pitches form unities when related by certain intervals, and the way theoretical claims form unities when related by explanatory co-dependence. Section V surveys the work of IV from the point of view of the initial difficulties and suggests further consequences for the hypothetical method, including the logical relation between the sumfvne›n and diafvne›n relations, and the need for care in ordering the results of a hypothesis. -/- “But anyhow I proceeded in this way: on each occasion hypothesising the lÒgow which I judged to be strongest, I put down as true the things that seem to me to sumfvne›n with it – both about a causal account and any of the other things that are – but those things that did not I put down as false.” (Phaedo 100a3-7). -/- “But if someone clung to the hypothesis itself, you would bid him goodbye and wouldn’t answer him until you had examined its results, whether according to you they sumfvne› or diafvne› with one another.” (Phaedo 101d3-5). (shrink)

This paper focuses on the Enkratic principle of rationality, according to which rationality requires that if an agent sincerely and with conviction believes she ought to X, then X-ing is a goal in her plan. We analyze the logical structure of Enkrasia and its implications for deontic logic. To do so, we elaborate on the distinction between basic and derived oughts, and provide a multi-modal neighborhood logic with three characteristic operators: a non-normal operator for basic oughts, a non-normal operator (...) for goals in plans, and a normal operator for derived oughts. We prove two completeness theorems for the resulting logic, and provide a dynamic extension of the logic by means of product updates. We illustrate how this setting informs deontic logic by considering issues related to the filtering of inconsistent oughts, the restricted validity of deontic closure, and the stability of oughts and goals under dynamics. (shrink)

This paper discusses critically what simulation models of the evolution ofcooperation can possibly prove by examining Axelrod’s “Evolution of Cooperation” and the modeling tradition it has inspired. Hardly any of the many simulation models of the evolution of cooperation in this tradition have been applicable empirically. Axelrod’s role model suggested a research design that seemingly allowed to draw general conclusions from simulation models even if the mechanisms that drive the simulation could not be identified empirically. But this research design was (...) fundamentally flawed, because it is not possible to draw general empirical conclusions from theoretical simulations. At best such simulations can claim to prove logical possibilities, i.e. they prove that certain phenomena are possible as the consequence of the modeling assumptions built into the simulation, but not that they are possible or can be expected to occur in reality I suggest several requirements under which proofs of logical possibilities can nevertheless be considered useful. Sadly, most Axelrod-style simulations do not meet these requirements. I contrast this with Schelling’s neighborhood segregation model, thecore mechanism of which can be retraced empirically. (shrink)

Rosenkranz (2021) devised two bimodal epistemic logics: an idealized one and a realistic one. The former is shown to be sound with respect to a class of neighborhood frames called i-frames. Rosenkranz designed a specific i-frame able to invalidate a series of undesired formulas, proving that these are not theorems of the idealized logic. Nonetheless, an unwanted formula and an unwanted rule of inference are not invalidated. Invalidating the former guarantees the distinction between the two modal operators characteristic (...) of the logic, while invalidating the latter is crucial in order to deal with the problem of logical omniscience. In this paper, I present an i-frame able to invalidate all the undesired formulas already invalidated by Rosenkranz, together with the missing formula and rule of inference. (shrink)

In the fifth version of our response-paper [26] to Imamura’s criticism, we recall that NonStandard Neutrosophic Logic was never used by neutrosophic community in no application, that the quarter of century old neutrosophic operators (1995-1998) criticized by Imamura were never utilized since they were improved shortly after but he omits to tell their development, and that in real world applications we need to convert/approximate the NonStandard Analysis hyperreals, monads and binads to tiny intervals with the desired accuracy – otherwise they (...) would be inapplicable. We point out several errors and false statements by Imamura [21] with respect to the inf/sup of nonstandard subsets, also Imamura’s “rigorous definition of neutrosophic logic” is wrong and the same for his definition of nonstandard unit interval, and we prove that there is not a total order on the set of hyperreals (because of the newly introduced Neutrosophic Hyperreals that are indeterminate), whence the Transfer Principle from R to R* is questionable. After his criticism, several response publications on theoretical nonstandard neutrosophics followed in the period 2018-2022. As such, I extended the NonStandard Analysis by adding the left monad closed to the right, right monad closed to the left, pierced binad (we introduced in 1998), and unpierced binad - all these in order to close the newly extended nonstandard space (R*) under nonstandard addition, nonstandard subtraction, nonstandard multiplication, nonstandard division, and nonstandard power operations [23, 24]. Improved definitions of NonStandard Unit Interval and NonStandard Neutrosophic Logic, together with NonStandard Neutrosophic Operators are presented. (shrink)

In the fifth version of our reply article [26] to Imamura's critique, we recall that Neutrosophic Non-Standard Logic was never used by the neutrosophic community in any application, that the quarter-century old (1995-1998) neutrosophic operators criticized by Imamura were never used as they were improved soon after, but omits to talk about their development, and that in real-world applications we need to convert/approximate the hyperreals, monads and bi-nads of Non-Standard Analysis to tiny intervals with the desired precision; otherwise they would (...) be inapplicable. We pointed out several errors and false statements by Imamura [21] regarding the inf/sup of nonstandard subsets, also Imamura's "rigorous definition of neutrosophic logic" is incorrect, as is his definition of nonstandard unit interval, and we showed that there is no total order in Neutrosophic Computing and Machine Learning , Vol. 23, 2022 Florentin Smarandache, Definición mejorada de la lógica neutrosófica no estándar e introducción a los hiperreales neutrosóficos (Quinta versión) 2 the set of hyperreals (due to the recently introduced Neutrosophic Hyperreals which are indeterminate), so the Transfer Principle from R to R* is questionable. After his critique, several reply posts on non-standard theoretical neutrosophy followed in 2018-2022. As such, I extended the Nonstandard Analysis by adding the right-closed left monad, the left-closed right monad, the punctured binad (which we introduced in 1998), and the nonpunctured binad - all in order to close the newly extended nonstandard space (R*) under nonstandard addition, nonstandard subtraction, nonstandard multiplication, nonstandard division, and nonstandard power operations [23, 24]. Improved definitions of the Nonstandard Unitary Interval and Nonstandard Neutrosophic Logic are presented, along with Nonstandard Neutrosophic Operators. (shrink)

The purpose of this paper is to open for investigation a range of phenomena familiar from dynamical systems or chaos theory which appear in a simple fuzzy logic with the introduction of self-reference. Within that logic, self-referential sentences exhibit properties of fixed point attractors, fixed point repellers, and full chaos on the [0, 1] interval. Strange attractors and fractals appear in two dimensions in the graphing of pairs of mutually referential sentences and appear in three dimensions in the graphing (...) of mutually referential triples. (shrink)

The topics approached in the 52 papers included in this book are: neutrosophic sets; neutrosophic logic; generalized neutrosophic set; neutrosophic rough set; multigranulation neutrosophic rough set (MNRS); neutrosophic cubic sets; triangular fuzzy neutrosophic sets (TFNSs); probabilistic single-valued (interval) neutrosophic hesitant fuzzy set; neutro-homomorphism; neutrosophic computation; quantum computation; neutrosophic association rule; data mining; big data; oracle Turing machines; recursive enumerability; oracle computation; interval number; dependent degree; possibility degree; power aggregation operators; multi-criteria group decision-making (MCGDM); expert set; soft sets; LA-semihypergroups; (...) single valued trapezoidal neutrosophic number; inclusion relation; Q-linguistic neutrosophic variable set; vector similarity measure; fundamental neutro-homomorphism theorem; neutro-isomorphism theorem; quasi neutrosophic triplet loop; quasi neutrosophic triplet group; BE-algebra; cloud model; Maclaurin symmetric mean; pseudo-BCI algebra; hesitant fuzzy set; photovoltaic plan; decision-making trial and evaluation laboratory (DEMATEL); Choquet integral; fuzzy measure; clustering algorithm; and many more. (shrink)

A “conceptual spaces” approach is used to formalize Aristotle’s main intuitions about time and change, and other ideas about temporal points of view. That approach has been used in earlier studies about points of view. Properties of entities are represented by locations in multidimensional conceptual spaces; and concepts of entities are identified with subsets or regions of conceptual spaces. The dimensions of the spaces, called “determinables”, are qualities in a very general sense. A temporal element is introduced by adding a (...) time variable to state functions that map entities into conceptual spaces. That way, states may have some permanency or stability around time instances. Following Aristotle’s intuitions, changes and events will not be necessarily instant phenomena, instead they could be processual and interval dependent. Change is defined relatively to the interval during which the change is taking place. Time intervals themselves are taken to represent points of view. To have a point of view is to look at the world as it is in the selected interval. Many important concepts are relativized to intervals, for instance change, events, identity, ontology, potentiality, etc. The definition of points of view as intervals allows to compare points of view in relation to all these concepts. The conceptual space approach has an immediate semantic and structural character, but it is tempting to develop also logics to describe them. A formal language is introduced to show how this could be done. (shrink)

This essay explores Kaila's interpretation of the special theory of relativity. Although the relevance of his work to logical empiricism is well-known, not much has been written on what Kaila calls the ‘Einstein-Minkowski invariance theory’. Kaila's interpretation focuses on two salient features. First, he emphasizes the importance of the invariance of the spacetime interval. The general point about spacetime invariance has been known at least since Minkowski, yet Kaila applies his overall tripartite theory of invariances to space, time and (...) spacetime in an original way. Second, Kaila provides a non-conventionalist argument for the isotropic speed of electromagnetic signals. The standard Einstein synchrony is not a mere convention but a part of a larger empirical theory. According to Kaila's holistic principle of testability, which stands in contrast to the theses of translatability and verification, different items in the theory cannot be sharply divided into conventional and empirical. Kaila's invariantism/non-conventionalism about relativity reflects an interesting case in the gradual transition from positivism to realism within the philosophy of science. (shrink)

We here propose a solution to the problem we have raised. Basically, the mathematical notion of entailment seems to be connected to the inferential rules from Classical Logic, so that if we have P: x belongs to the reals, and Q: x+2=5 => x=3, P |= Q. Notwithstanding, we would also have that if P: x belongs to the interval (7,10), and Q: x+2=5 => x=3, P |= Q. The second instance of entailment does not seem to be justifiable (...) if our intuition is consulted: Even though we could say that absurdity implies anything in Classical Logic, entailment should be a concept that belongs to the metalogic, not to the logic of the system, so that we should not be inside of the Classical Logic World by the time we assess things in what regards entailment. As another point, our discussions in Entailment led us to choose the sense has as a consequence for entailment, so that it is not really acceptable that we have, as a consequence, using normal language, of x being inside of the real interval (7,10) that if x+2=5, then x=3. If x is in that interval, x+2 should not be 5, unless we are talking about moduli of vectors. However, when we transfer to Classical Logic, in having the antecedent false, and the consequent false as well, we have that the implication, which some call material, is true. We here discuss this sort of matter in detail, and hope to get to the bottom of the issue, and perhaps to a universal solution. (shrink)

The word ‘equality’ often requires disambiguation, which is provided by context or by an explicit modifier. For each sort of magnitude, there is at least one sense of ‘equals’ with its correlated senses of ‘is greater than’ and ‘is less than’. Given any two magnitudes of the same sort—two line segments, two plane figures, two solids, two time intervals, two temperature intervals, two amounts of money in a single currency, and the like—the one equals the other or the one is (...) greater than the other or the one is greater than the other [sc. in appropriate correlated senses of ‘equals’, ‘is greater than’ and ‘is less than’]. In case there are two or more appropriate senses of ‘equals’, the one intended is often indicated by an adverb. For example, one plane figure may be said to be equal in area to another and, in certain cases, one plane figure may be said to be equal in length to another. Each sense of ‘equality’ is tied to a specific domain and is therefore non-logical. Notice that in every cases ‘equality’ is definable in terms of ‘is greater than’ and also in terms of ‘is less than’ both of which are routinely considered domain specific, non-logical. The word ‘identity’ in the logical sense does not require disambiguation. Moreover, it is not correlated ‘is greater than’ and ‘is less than’. If it is not the case that a certain designated triangle is [sc. is identical to] an otherwise designated triangle, it is not necessary for the one to be greater than or less than the other. Moreover, if two magnitudes are equal then a unit of measure can be chosen and, no matter what unit is chosen, each magnitude is the same multiple of the unit that the other is. But identity does not require units. In this regard, congruence is like identity and unlike equality. In arithmetic, the logical concept of identity is coextensive with the arithmetic concept of equality. The logical concept of identity admits of an analytically adequate definition in terms of logical concepts: given any number x and any number y, x is y iff x has every property that y has. The arithmetical concept of equality admits of an analytically adequate definition in terms of arithmetical concepts: given any number x and any number y, x equals y iff x is neither less than nor greater than y. As Aristotle told us and as Frege retold us, just because one relation is coextensive with another is no reason to conclude that they are one. (shrink)

The topics approached in this collection of papers are: neutrosophic sets; neutrosophic logic; generalized neutrosophic set; neutrosophic rough set; multigranulation neutrosophic rough set (MNRS); neutrosophic cubic sets; triangular fuzzy neutrosophic sets (TFNSs); probabilistic single-valued (interval) neutrosophic hesitant fuzzy set; neutro-homomorphism; neutrosophic computation; quantum computation; neutrosophic association rule; data mining; big data; oracle Turing machines; recursive enumerability; oracle computation; interval number; dependent degree; possibility degree; power aggregation operators; multi-criteria group decision-making (MCGDM); expert set; soft sets; LA-semihypergroups; single valued trapezoidal (...) neutrosophic number; inclusion relation; Q-linguistic neutrosophic variable set; vector similarity measure; fundamental neutro-homomorphism theorem; neutro-isomorphism theorem; quasi neutrosophic triplet loop; quasi neutrosophic triplet group; BE-algebra; cloud model; fuzzy measure; clustering algorithm; and many more. (shrink)

K denotes both the knowledge predicate satisfied by every currently known theorem and the finite set of all currently known theorems. The set K is time-dependent, publicly available, and contains theorems both from formal and constructive mathematics. Any theorem of any mathematician from past or present forever belongs to K. Mathematical statements with known constructive proofs exist in K separately and form the set K_c⊆K. We assume that mathematical sets are atemporal entities. They exist formally in ZFC theory although their (...) properties can be time-dependent (when they depend on K) or informal. The true statement "K is non-empty" is outside K forever because K is not a formal set. Paul Cohen proved in 1963 that the equality 2^{\aleph_0}=\aleph_1 is independent of ZFC. Before 1963, the statement "There is a known constructively defined integer n⩾1 such that 2^{\aleph_0}=\aleph_n" was outside K. Since 1963, this statement is outside K forever. The true statement "There exists a set X⊆{1,...,49} such that card(X)=6 and X never occurred as the winning six numbers in the Polish Lotto lottery" refers to the current non-mathematical knowledge and is outside K forever. In Martin-Löf's terminology, every currently known theorem is actually true whereas every theorem (known or unknown) is potentially true. Actual truth is knowledge dependent and tensed. Potential truth is knowledge independent and tenseless. Algorithms always terminate. We explain the distinction between algorithms whose existence is provable in ZFC and constructively defined algorithms which are currently known. By using this distinction, we obtain non-trivially true statements on decidable sets X⊆N that belong to constructive and informal mathematics and refer to the current mathematical knowledge on X. For every such statement, its truth concerning the current mathematical knowledge is implied by a true statement of the form: (the conjunction of i conditions of the form α∈K)∧(the conjunction of j conditions of the form β∉K)∧(the conjunction of k conditions of the form γ∈K_c)∧(the conjunction of l conditions of the form δ∉K_c), where i,j,k,l∈N and α,β,γ,δ are mathematical statements. In constructive mathematics and the traditional Brouwerian intuitionism, the truth of a mathematical statement means that we know a constructive proof. Therefore, the truth of a mathematical statement depends on time, where the statement is formally stated in the classical mathematics without the predicate K. In this article, mathematical statements on decidable sets X⊆N refer to time because they refer to the current mathematical knowledge on X. They cannot be formally stated in the classical mathematics without the predicate K and their logical values may change in time. For a set X⊆N whose infiniteness is false or unproven, we define which elements of X are classified as known. No known set X⊆N satisfies Conditions (1)-(4) and is widely known in number theory or naturally defined, where this term has only informal meaning. (1) A known algorithm with no input returns an integer n satisfying card(X)<ω ⇒ X⊆(-∞,n]. (2) A known algorithm for every k∈N decides whether or not k∈X. (3) For every known algorithm A with no input, the statement "A returns the logical value of the statement card(X)=ω" is outside K. (4) There are many elements of X and it is conjectured, though so far unproven, that X is infinite. (5) X is naturally defined. The infiniteness of X is false or unproven. X has the simplest definition among known sets Y⊆N with the same set of known elements. No set X⊆N will satisfy Conditions (1)-(4) forever, if for every algorithm with no input, at some future day, a computer will be able to execute this algorithm in 1 second or less. The physical limits of computation disprove the assumption of the above statement. We prove that the set X={n∈N: the interval [-1,n] contains more than 29.5+(11!/(3n+1))∙sin(n) primes of the form k!+1} satisfies Conditions (1)-(5) except the requirement that X is naturally defined. We present a table that shows satisfiable conjunctions of the form #(Condition1)∧(Condition 2)∧#(Condition 3)∧(Condition 4)∧#(Condition 5), where # denotes the negation ¬ or the absence of any symbol. We prove that there exists a naturally defined set C⊆N which satisfies the following conditions (6)-(11). (6) A known and simple algorithm for every k∈N decides whether or not k∈C. (7) For every known algorithm A with no input, the statement "A returns the logical value of the statement card(C)=ω" is outside K. (8) For every known algorithm A with no input, the statement "A returns the logical value of the statement card(N\C)=ω" is outside K. (9) It is conjectured, though so far unproven, that C is infinite. (10) For every known algorithm A with no input, the statement "A returns an integer n satisfying card(C)<ω ⇒ C⊆(-∞,n]" is outside K. (11) For every known algorithm A with no input, the statement "A returns an integer m satisfying card(N\C)<ω ⇒ N\C⊆(-∞,m]" is outside K. The set C={k∈N: 2^{2^k}+1 is composite} is naturally defined and satisfies conditions (6)-(11). (shrink)

How does being a woman affect one’s epistemic life? What about being Black? Or queer? Standpoint theorists argue that such social positions can give rise to otherwise unavailable epistemic privilege. “Epistemic privilege” is a murky concept, however. Critics of standpoint theory argue that the view is offered without a clear explanation of how standpoints confer their benefits, what those benefits are, or why social positions are particularly apt to produce them. For this reason, many regard standpoint theory as being out (...) of step with epistemology more broadly. But this need not be so. This article articulates a minimal version of standpoint epistemology that avoids these criticisms and supports the normative goals of its feminist forerunners. This account serves as the foundation for developing a formal model in which to explore standpoint epistemology using neighborhood semantics for modal logic. (shrink)

[186 pages] Just as the six branches of a snow crystal converge in regular proportions toward their common center, the six contributions to this book point toward a future philosophy of cosmic life. In this sense, this edited volume represents a multidisciplinary and transcultural polylogue of distinguished authors from three continents, which aims to establish highly innovative perspectives and open new frontiers of developing philosophical reflections and scientific foundations for the emergence of a common cosmic consciousness, for an integral ecology, (...) and for a cooperative planetary civilization of humanity. John B. Cobb, Jr. uses a process-philosophical foundation to describe life as living events expressing novelty and the cosmos as a process of self-enriching and self-evolving “Life Itself.” Chandra Wickramasinghe unfolds his scientific and philosophical perspective on cosmic life in twelve successive steps, offering a wide range of arguments and insights that support an up-to-date theory of panspermia. Attila Grandpierre presents the "Cosmic Life Principle" and the comprehensive science based upon it that is inextricably linked to the healthy and cooperative civilization, to the biological laws of nature, to the laws of logic, to the uplifting of the well-being of people and ecological communities. Chunyou Yan introduces the approach of his holographic philosophy, according to which the universe must be understood as a vast living entity, every aspect of which represents life. Bei Peng shows that the proportions of energy meridians in traditional Chinese medicine correspond to musical intervals, and on this basis she demonstrates the analogy of the human body to macrocosmic phenomena. David Bartosch offers an examination of three important systematic foundations for a poly-contextural, transcultural philosophy of cosmic life with roots in Greek, Chinese, South and West Asian, and European traditions of thought. (shrink)

Semantic dispositionalism is roughly the view that meaning a certain thing by a word, or possessing a certain concept, consists in being disposed to do something, e.g., infer a certain way. Its main problem is that it seems to have so many and disparate exceptions. People can fail to infer as required due to lack of logical acumen, intoxication, confusion, deviant theories, neural malfunctioning, and so on. I present a theory stating possession conditions of concepts that are counterfactuals, rather than (...) disposition attributions, but which is otherwise similar to inferentialist versions of dispositionalism. I argue that it can handle all the exceptions discussed in the literature without recourse to ceteris paribus clauses. Psychological exceptions are handled by suitably undemanding requirements (unlike that of giving the sum of any two numbers) and by setting the following two preconditions upon someone’s making the inference: that she considers the inference and has no motivating reason against it. The non-psychological exceptions, i.e., cases of neural malfunctioning, are handled by requiring that the counterfactuals be true sufficiently often during the relevant interval. I argue that this accommodates some important intuitions about concept possession, in particular, the intuition that concept possession is vague along a certain dimension. (shrink)

We present an elementary system of axioms for the geometry of Minkowski spacetime. It strikes a balance between a simple and streamlined set of axioms and the attempt to give a direct formalization in first-order logic of the standard account of Minkowski spacetime in [Maudlin 2012] and [Malament, unpublished]. It is intended for future use in the formalization of physical theories in Minkowski spacetime. The choice of primitives is in the spirit of [Tarski 1959]: a predicate of betwenness and a (...) four place predicate to compare the square of the relativistic intervals. Minkowski spacetime is described as a four dimensional ‘vector space’ that can be decomposed everywhere into a spacelike hyperplane - which obeys the Euclidean axioms in [Tarski and Givant, 1999] - and an orthogonal timelike line. The length of other ‘vectors’ are calculated according to Pythagora’s theorem. We conclude with a Representation Theorem relating models of our system that satisfy second order continuity to the mathematical structure called ‘Minkowski spacetime’ in physics textbooks. (shrink)

There is no uniquely standard concept of an effectively decidable set of real numbers or real n-tuples. Here we consider three notions: decidability up to measure zero [M.W. Parker, Undecidability in Rn: Riddled basins, the KAM tori, and the stability of the solar system, Phil. Sci. 70(2) (2003) 359–382], which we abbreviate d.m.z.; recursive approximability [or r.a.; K.-I. Ko, Complexity Theory of Real Functions, Birkhäuser, Boston, 1991]; and decidability ignoring boundaries [d.i.b.; W.C. Myrvold, The decision problem for entanglement, in: R.S. (...) Cohen et al. (Eds.), Potentiality, Entanglement, and Passion-at-a-Distance: Quantum Mechanical Studies fo Abner Shimony, Vol. 2, Kluwer Academic Publishers, Great Britain, 1997, pp. 177–190]. Unlike some others in the literature, these notions apply not only to certain nice sets, but to general sets in Rn and other appropriate spaces. We consider some motivations for these concepts and the logical relations between them. It has been argued that d.m.z. is especially appropriate for physical applications, and on Rn with the standard measure, it is strictly stronger than r.a. [M.W. Parker, Undecidability in Rn: Riddled basins, the KAM tori, and the stability of the solar system, Phil. Sci. 70(2) (2003) 359–382]. Here we show that this is the only implication that holds among our three decidabilities in that setting. Under arbitrary measures, even this implication fails. Yet for intervals of non-zero length, and more generally, convex sets of non-zero measure, the three concepts are equivalent. (shrink)

This paper describes a cubic water tank equipped with a movable partition receiving various amounts of liquid used to represent joint probability distributions. This device is applied to the investigation of deductive inferences under uncertainty. The analogy is exploited to determine by qualitative reasoning the limits in probability of the conclusion of twenty basic deductive arguments (such as Modus Ponens, And-introduction, Contraposition, etc.) often used as benchmark problems by the various theoretical approaches to reasoning under uncertainty. The probability bounds imposed (...) by the premises on the conclusion are derived on the basis of a few trivial principles such as "a part of the tank cannot contain more liquid than its capacity allows", or "if a part is empty, the other part contains all the liquid". This stems from the equivalence between the physical constraints imposed by the capacity of the tank and its subdivisions on the volumes of liquid, and the axioms and rules of probability. The device materializes de Finetti's coherence approach to probability. It also suggests a physical counterpart of Dutch book arguments to assess individuals' rationality in probability judgments in the sense that individuals whose degrees of belief in a conclusion are out of the bounds of coherence intervals would commit themselves to executing physically impossible tasks. (shrink)

We have defined the Neutrosophic Over- /Under-/Off-Set and -Logic for the first time in 1995 and published in 2007. During 1995-2016 we presented them to various national and international conferences and seminars ([16]-[37]) and did more publishing during 2007-2016 ([1]-[15]). These new notions are totally different from other sets/logics/probabilities. We extended the neutrosophic set respectively to Neutrosophic Overset {when some neutrosophic component is > 1}, to Neutrosophic Underset {when some neutrosophic component is < 0}, and to Neutrosophic Offset {when (...) some neutrosophic components are off the interval [0, 1], i.e. some neutrosophic component > 1 and other neutrosophic component < 0}. This is no surprise since our real-world has numerous examples and applications of over-/under-/off-neutrosophic components. (shrink)

Guided by key insights of the four great philosophers mentioned in the title, here, in review of and expanding on our earlier work (Burchard, 2005, 2011), we present an exposition of the role played by language, & in the broader sense, λογοζ, the Logos, in how the CNS, the brain, is running the human being. Evolution by neural Darwinism has been forcing the linguistic nature of mind, enabling it to overcome & exploit the cognitive gap between an animal and its (...) world by recognizing environmental structures. Our work was greatly influenced by Heidegger’s lecture notes on metaphysics (Heidegger, 1935). We found agreement with recent progress in neuroscience, but also mathematical foundations of language theory, equating Logos with the mathematical concept of structure. The mystery of perception across the gap is analyzed as radiation and molecules impinging on sensory neurons that carry linguistic information about gross environmental structures, and only remotely about the physical reality of elementary particles. The most important logical brain function is Ego or Self, guiding the workings of the brain as a logos machine. Ego or Self operates from neurons in frontopolar cortex with global receptive fields. The logos machine can function only by availing itself of global context, its internally stored noumenal cosmos NK, and the categorical-conceptual apparatus CCA, updated continually through the neural default mode network (Raichle, 2005). In the Transcendental Deduction, Immanuel Kant discovered that Ego or Self is responsible for conscious control in perception relying on concepts & categories for a fitting percept to be incorporated intoNK. The entire CNS runs as a “movie-in-the-brain” (Parvizi & Damasio, 2001), at peak speed processing simultaneously in a series of cortical centers a stack of up to twelve frames in gamma rhythm of 25 ms intervals. We equate global context, or NK, with our human world, Heidegger’s Dasein being-in-the-world, and are able to demonstrate that the great philosopher in EM parallels neuro-science concerning the human mind. (shrink)

Let f(1)=2, f(2)=4, and let f(n+1)=f(n)! for every integer n≥2. Edmund Landau's conjecture states that the set P(n^2+1) of primes of the form n^2+1 is infinite. Landau's conjecture implies the following unproven statement Φ: card(P(n^2+1))<ω ⇒ P(n^2+1)⊆[2,f(7)]. Let B denote the system of equations: {x_j!=x_k: i,k∈{1,...,9}}∪{x_i⋅x_j=x_k: i,j,k∈{1,...,9}}. The system of equations {x_1!=x_1, x_1 \cdot x_1=x_2, x_2!=x_3, x_3!=x_4, x_4!=x_5, x_5!=x_6, x_6!=x_7, x_7!=x_8, x_8!=x_9} has exactly two solutions in positive integers x_1,...,x_9, namely (1,...,1) and (f(1),...,f(9)). No known system S⊆B with a finite (...) number of solutions in positive integers x_1,...,x_9 has a solution (x_1,...,x_9)∈(N\{0})^9 satisfying max(x_1,...,x_9)>f(9). For every known system S⊆B, if the finiteness/infiniteness of the set {(x_1,...,x_9)∈(N\{0})^9: (x_1,...,x_9) solves S} is unknown, then the statement ∃ x_1,...,x_9∈N\{0} ((x_1,...,x_9) solves S)∧(max(x_1,...,x_9)>f(9)) remains unproven. Let Λ denote the statement: if the system of equations {x_2!=x_3, x_3!=x_4, x_5!=x_6, x_8!=x_9, x_1 \cdot x_1=x_2, x_3 \cdot x_5=x_6, x_4 \cdot x_8=x_9, x_5 \cdot x_7=x_8} has at most finitely many solutions in positive integers x_1,...,x_9, then each such solution (x_1,...,x_9) satisfies x_1,...,x_9≤f(9). The statement Λ is equivalent to the statement Φ. It heuristically justifies the statement Φ . This justification does not yield the finiteness/infiniteness of P(n^2+1). We present a new heuristic argument for the infiniteness of P(n^2+1), which is not based on the statement Φ. Algorithms always terminate. We explain the distinction between existing algorithms (i.e. algorithms whose existence is provable in ZFC) and known algorithms (i.e. algorithms whose definition is constructive and currently known). Assuming that the infiniteness of a set X⊆N is false or unproven, we define which elements of X are classified as known. No known set X⊆N satisfies Conditions (1)-(4) and is widely known in number theory or naturally defined, where this term has only informal meaning. *** (1) A known algorithm with no input returns an integer n satisfying card(X)<ω ⇒ X⊆(-∞,n]. (2) A known algorithm for every k∈N decides whether or not k∈X. (3) No known algorithm with no input returns the logical value of the statement card(X)=ω. (4) There are many elements of X and it is conjectured, though so far unproven, that X is infinite. (5) X is naturally defined. The infiniteness of X is false or unproven. X has the simplest definition among known sets Y⊆N with the same set of known elements. *** Conditions (2)-(5) hold for X=P(n^2+1). The statement Φ implies Condition (1) for X=P(n^2+1). The set X={n∈N: the interval [-1,n] contains more than 29.5+\frac{11!}{3n+1}⋅sin(n) primes of the form k!+1} satisfies Conditions (1)-(5) except the requirement that X is naturally defined. 501893∈X. Condition (1) holds with n=501893. card(X∩[0,501893])=159827. X∩[501894,∞)= {n∈N: the interval [-1,n] contains at least 30 primes of the form k!+1}. We present a table that shows satisfiable conjunctions of the form #(Condition 1) ∧ (Condition 2) ∧ #(Condition 3) ∧ (Condition 4) ∧ #(Condition 5), where # denotes the negation ¬ or the absence of any symbol. No set X⊆N will satisfy Conditions (1)-(4) forever, if for every algorithm with no input, at some future day, a computer will be able to execute this algorithm in 1 second or less. The physical limits of computation disprove this assumption. (shrink)

Human epistemic subjects cannot but employ imperfect and limited tools to gain knowledge. Even in the seemingly simple business of acquiring knowledge of the value of a physical quantity, what the instrument reads or perception tells more often that not does not correspond to real value. However, even though both our perceptual apparatus and measuring instruments are sensible to background noise, under certain conditions, collecting more information of the same quantity using the same tools leads to an improvement of the (...) subject's epistemic condition. The aim of this paper is to formalize this intuition employing a model which extends Williamson (2013) on the arising of Gettier cases in epistemic logic. From a model where each world is univocally represented by the pair r, a defined by the real value and the apparent one, I will be considering a scenario wherein the subject has collected n appearances of the real parameter, so that each world is identified by a n + 1-tuple. On the assumptions that the n data are all independent and regarded by the subject as equally reliable, a plausible model should be able to describe three phenomena. First of all, the more coherent and closer to represent the real value the set of n appearances is, the more knowledge of the real value is gained. Secondly, the more the subject goes on acquiring "good" data, the more she knows. Thirdly, the world where the n apparent values and the real one match is the best world for the subject. Following Williamson, I shall put forth a system for multiple appearances in epistemic logic that aims at modeling these phenomena by describing the interval within which the real value is known to lie. (shrink)

The scientific study of socio-cultural phenomenon requires a translocation of topics elaborated from the social perspective of the individual to a rationally ordered rendition of processes suitable for comprehension from a scientific perspective. Scholarly curiosity seeded from exposure in the natural setting to economic, political, socio-cultural, evolutionary, processes dictates that study of the self, should be a science with a necessary place in the body of world literatures; yet it has proven difficult to find a perspective to contain discussions of (...) topics in a coherent manner for scientific approach: for example, anthropology, the study of mankind, finds difficulty elaborating definition for the orientation of study; it is a member of the same set that contains it. In this presentation, based on features indigenous to a supposed distant perspective that is exposed employing experiences of history and criteria of common sensory perception, it is conjectured that a civilization lifetime pathology is contemporarily active. Example is taken from philosophical and sociological discourses, modern science theory, medicine in pursuit of international health issues, to capture conceptually a role of motions of external agents occurred within the interval of observation, elaboration of concepts, choice of directions, as a source of paradox and confusion. In supposition that does not escape simple logic, ubiquitously appealing to the experience bound senses for understanding, hidden motions, common to both observer and observed, are hypothesized to render from a sense of familiarity, a continued frustration in attaining an understanding of the self and nature. A psychical seduction is proposed to exist, related to historical behaviors associated with centrism and asceticism, produces eccentric interpretations that are bound modernly to logical circular, centric geometrical reasonings; world conceptualizations are conjectured to acquire an avoidance of a state of ‘motionless’ rather than death within selection processes. Projection by the imagination upon the unknown is conjectured to result in a seduction by an active ‘live-wire” embodied to motions occurred to a distant surface. (shrink)

This Paper combines interval- valued neutrouphic sets and rough sets. It studies roughness in interval- valued neutrosophic sets and some of its properties. Finally we propose a Hamming distance between lower and upper approximations of interval valued neutrosophic sets.

This paper begins with a response to Josh Gert’s challenge that ‘on a par with’ is not a sui generis fourth value relation beyond ‘better than’, ‘worse than’, and ‘equally good’. It then explores two further questions: can parity be modeled by an interval representation of value? And what should one rationally do when faced with items on a par? I argue that an interval representation of value is incompatible with the possibility that items are on a par (...) (a mathematical proof is given in the appendix). I also suggest that there are three senses of ‘rationally permissible’ which, once distinguished, show that parity does distinctive practical work that cannot be done by the usual trichotomy of relations or by incomparability. In this way, we have an additional argument for parity from the workings of practical reason. (shrink)

Carter (Noûs 55(1):171–198, 2021) argued that while most simple positive numerical sentences are literally false, they can communicate true contents because relevance has a weakening effect on their literal contents. This paper presents a challenge for his account by considering entailments between the imprecise contents of numerical sentences and the imprecise contents of comparatives. I argue that while Carter's weakening mechanism can generate the imprecise contents of plain comparatives such as `A is taller than B', it cannot generate the imprecise (...) contents of comparatives that quantify the difference between their arguments, such as `A is exactly n times as tall as B'. I then propose an alternative theory on which intervals serve as both thick degrees on a scale and denotations of numerical expressions. I argue that the alternative theory can account for the imprecise contents of both forms of comparatives as well as the data that motivate Carter's theory. (shrink)

Collective self-determination is considered to be an important political value. Many liberal political philosophers appeal to it to defend the right of states to exclude would-be newcomers. In this paper, I challenge the value of collective self-determination in the case of countries like the US, former colonial powers with a history of white supremacist immigration and citizenship policies. I argue for my claim by way of an analogy: There is no value to white neighborhoods in the US, which are the (...) result of racist attitudes and state policies, determining autonomously who should become a neighbor. In light of this commitment, defenders of the US's right to exclude would need to explain why it should be of moral value that a community whose character and composition has been shaped by white supremacy be able to determine its membership on its own terms. (shrink)

In this paper, we first defined soft intervalvalued neutrosophic rough sets(SIVN- rough sets for short) which combines interval valued neutrosophic soft set and rough sets and studied some of its basic properties. This concept is an extension of soft interval valued intuitionistic fuzzy rough sets( SIVIF- rough sets). Finally an illustartive example is given to verfy the developped algorithm and to demonstrate its practicality and effectiveness.

In this paper we introduce the concept of interval valued neutrosophic soft topological space together with interval valued neutrosophic soft finer and interval valued neutrosophic soft coarser topology. We also define interval valued neutrosophic interior and closer of an interval valued neutrosophic soft set. Some theorems and examples are cites. Interval valued neutrosophic soft subspace topology are studied. Some examples and theorems regarding this concept are presented.

This paper analyses a hitherto unknown technique of using logic diagrams to create argument maps in eristic dialectics. The method was invented in the 1810s and -20s by Arthur Schopenhauer, who is considered the originator of modern eristic. This technique of Schopenhauer could be interesting for several branches of research in the field of argumentation: Firstly, for the field of argument mapping, since here a hitherto unknown diagrammatic technique is shown in order to visualise possible situations of arguments in a (...) dialogical controversy. Secondly, the art of controversy or eristic, since the diagrams do not analyse the truth of judgements and the validity of inferences, but the persuasiveness of arguments in a dialogue. (shrink)

Gaining information can be modelled as a narrowing of epistemic space . Intuitively, becoming informed that such-and-such is the case rules out certain scenarios or would-be possibilities. Chalmers’s account of epistemic space treats it as a space of a priori possibility and so has trouble in dealing with the information which we intuitively feel can be gained from logical inference. I propose a more inclusive notion of epistemic space, based on Priest’s notion of open worlds yet which contains only those (...) epistemic scenarios which are not obviously impossible. Whether something is obvious is not always a determinate matter and so the resulting picture is of an epistemic space with fuzzy boundaries. (shrink)

This work treats the correlative concepts knowledge and opinion, in various senses. In all senses of ‘knowledge’ and ‘opinion’, a belief known to be true is knowledge; a belief not known to be true is opinion. In this sense of ‘belief’, a belief is a proposition thought to be true—perhaps, but not necessarily, known to be true. All knowledge is truth. Some but not all opinion is truth. Every proposition known to be true is believed to be true. Some but (...) not every proposition believed to be true is known to be true. Our focus is thus on propositional belief (“belief-that”): the combination of propositional knowledge (“knowledge-that”) and propositional opinion (“opinion-that”). Each of a person’s beliefs, whether knowledge or opinion, is the end result of a particular thought process that continued during a particular time interval and ended at a particular time with a conclusive act—a judgment that something is the case. This work is mainly about beliefs in substantive informative propositions—not empty tautologies. We also treat objectual knowledge (knowledge of objects in the broadest sense, or “knowledge-of”), operational knowledge (abilities and skills, “knowledge-how-to”, or “know-how”), and expert knowledge (expertise). Most points made in this work have been made by previous writers, but to the best of our knowledge, they have never before been collected into a coherent work accessible to a wide audience. -/- Key words: belief, knowledge/opinion, propositional, operational, objectual, cognition, . (shrink)

Interval bipolar neutrosophic set is a significant extension of interval neutrosophic set where every element of the set comprises of three independent positive membership functions and three independent negative membership functions. In this study, we first define correlation coefficient, and weighted correlation coefficient measures of interval bipolar neutrosophic sets and prove their basic properties. Then, we develop a new multi-attribute decision making strategy based on the proposed weighted correlation coefficient measure. Finally, we solve an investment problem with (...) interval bipolar neutrosophic information and comparison is given to demonstrate the applicability and effectiveness of the proposed strategy. (shrink)

In this article, we apply the notion of interval neutrosophic sets to ideal theory in BCK/BCI-algebras.

Once upon a time, logical conventionalism was the most popular philosophical theory of logic. It was heavily favored by empiricists, logical positivists, and naturalists. According to logical conventionalism, linguistic conventions explain logical truth, validity, and modality. And conventions themselves are merely syntactic rules of language use, including inference rules. Logical conventionalism promised to eliminate mystery from the philosophy of logic by showing that both the metaphysics and epistemology of logic fit into a scientific picture of reality. For naturalists of all (...) stripes, this was paradise. Alas, paradise was lost. By the end of the twentieth century, logical conventionalism had been almost universally abandoned. But more recently, it has been revitalized. This chapter provides an overview of logical conventionalism and its history, clears away misunderstandings, and briefly responds to both the canonical objections to conventionalism (from Quine, Dummett, Boghossian, and many others) as well as new objections (from Field and Golan). From paradise lost, to paradise regained: logical conventionalism is back. (shrink)

We prove that all extensions of Heyting Arithmetic with a logic that has the finite frame property possess the de Jongh property.

We prove that all extensions of Heyting Arithmetic with a logic that has the finite frame property possess the de Jongh property.

In this paper, we define a new cosine similarity between two interval valued neutrosophic sets based on Bhattacharya’s distance [19]. The notions of interval valued neutrosophic sets (IVNS, for short) will be used as vector representations in 3D-vector space. Based on the comparative analysis of the existing similarity measures for IVNS, we find that our proposed similarity measure is better and more robust. An illustrative example of the pattern recognition shows that the proposed method is simple and effective.