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)

Consider an infinite set of discrete, finite-sized solid balls (i.e., elements) extending in all directions forever. Here, infinite set is not meant so much in the abstract, mathematical sense but in more of a physical sense where the balls have physical size and physical location-type relationships with their neighbors. In this sense, the set is used as an analogy for our possibly infinite physical universe. Two observers are viewing this set. One observer is internal to the set (...) and is of the same finite size scale as the ball elements. Another observer is external to the set and is infinite in size relative to the balls and observer within the set. This observer is of the same size scale as the set as a whole. What do these sets look like to the two observers? The finite-sized (relative to the balls inside the set) observer within the set would view the set as a space composed of discrete, finite-sized objects. The external infinite-sized (relative to the inside the set) observer would view the very same set as a continuous space and would see no distinct elements within the set. How does this relate to us? First, the differing views of set N as being composed of a discrete versus continuous space may be related to the differing views of spacetime as discrete and continuous. Second, the perspective of the observer would have an impact on the assignment of a cardinality to an infinite set. (shrink)

Yuri Matiyasevich's theorem states that the set of all Diophantine equations which have a solution in non-negative integers is not recursive. Craig Smoryński's theorem states that the set of all Diophantine equations which have at most finitely many solutions in non-negative integers is not recursively enumerable. Let R be a subring of Q with or without 1. By H_{10}(R), we denote the problem of whether there exists an algorithm which for any given Diophantine equation with integer coefficients, can decide whether (...) or not the equation has a solution in R. We prove that a positive solution to H_{10}(R) implies that the set of all Diophantine equations with a finite number of solutions in R is recursively enumerable. We show the converse implication for every infinite set R \subseteq Q such that there exist computable functions \tau_1,\tau_2:N \to Z which satisfy (\forall n \in N \tau_2(n) \neq 0) \wedge ({\frac{\tau_1(n)}{\tau_2(n)}: n \in N}=R). This implication for R=N guarantees that Smoryński's theorem follows from Matiyasevich's theorem. Harvey Friedman conjectures that the set of all polynomials of several variables with integer coefficients that have a rational solution is not recursive. Harvey Friedman conjectures that the set of all polynomials of several variables with integer coefficients that have only finitely many rational solutions is not recursively enumerable. These conjectures are equivalent by our results for R=Q. (shrink)

Conventional wisdom dictates that proofs of mathematical propositions should be treated as necessary, and sufficient, for entailing `significant' mathematical truths only if the proofs are expressed in a---minimally, deemed consistent---formal mathematical theory in terms of: * Axioms/Axiom schemas * Rules of Deduction * Definitions * Lemmas * Theorems * Corollaries. Whilst Andrew Wiles' proof of Fermat's Last Theorem FLT, which appeals essentially to geometrical properties of real and complex numbers, can be treated as meeting this criteria, it nevertheless leaves two (...) questions unanswered: (i) Why is x^n +y^n = z^n solvable only for n < 3 if x, y, z, n are natural numbers? (ii) What technique might Fermat have used that led him to, even if only briefly, believe he had `a truly marvellous demonstration' of FLT? Prevailing post-Wiles wisdom---leaving (i) essentially unaddressed---dismisses Fermat's claim as a conjecture without a plausible proof of FLT. -/- However, we posit that providing evidence-based answers to both queries is necessary not only for treating FLT as significant, but also for understanding why FLT can be treated as a true arithmetical proposition. We thus argue that proving a theorem formally from explicit, and implicit, premises/axioms using rules of deduction---as currently accepted---is a meaningless game, of little scientific value, in the absence of evidence that has already established---unambiguously---why the premises/axioms and rules of deduction can be treated, and categorically communicated, as pre-formal truths in Marcus Pantsar's sense. Consequently, only evidence-based, pre-formal, truth can entail formal provability; and the formal proof of any significant mathematical theorem cannot entail its pre-formal truth as evidence-based. It can only identify the explicit/implicit premises that have been used to evidence the, already established, pre-formal truth of a mathematical proposition. Hence visualising and understanding the evidence-based, pre-formal, truth of a mathematical proposition is the only raison d'etre for subsequently seeking a formal proof of the proposition within a formal mathematical language (whether first-order or second order set theory, arithmetic, geometry, etc.) By this yardstick Andrew Wiles' proof of FLT fails to meet the required, evidence-based, criteria for entailing a true arithmetical proposition. -/- Moreover, we offer two scenarios as to why/how Fermat could have laconically concluded in his recorded marginal noting that FLT is a true arithmetical proposition---even though he either did not (or could not to his own satisfaction) succeed in cogently evidencing, and recording, why FLT can be treated as an evidence-based, pre-formal, arithmetical truth (presumably without appeal to properties of real and complex numbers). It is primarily such a putative, unrecorded, evidence-based reasoning underlying Fermat's laconic assertion which this investigation seeks to reconstruct; and to justify by appeal to a plausible resolution of some philosophical ambiguities concerning the relation between evidence-based, pre-formal, truth and formal provability. (shrink)

This tenth volume of Collected Papers includes 86 papers in English and Spanish languages comprising 972 pages, written between 2014-2022 by the author alone or in collaboration with the following 105 co-authors (alphabetically ordered) from 26 countries: Abu Sufian, Ali Hassan, Ali Safaa Sadiq, Anirudha Ghosh, Assia Bakali, Atiqe Ur Rahman, Laura Bogdan, Willem K.M. Brauers, Erick González Caballero, Fausto Cavallaro, Gavrilă Calefariu, T. Chalapathi, Victor Christianto, Mihaela Colhon, Sergiu Boris Cononovici, Mamoni Dhar, Irfan Deli, Rebeca Escobar-Jara, Alexandru Gal, N. (...) Gandotra, Sudipta Gayen, Vassilis C. Gerogiannis, Noel Batista Hernández, Hongnian Yu, Hongbo Wang, Mihaiela Iliescu, F. Nirmala Irudayam, Sripati Jha, Darjan Karabašević, T. Katican, Bakhtawar Ali Khan, Hina Khan, Volodymyr Krasnoholovets, R. Kiran Kumar, Manoranjan Kumar Singh, Ranjan Kumar, M. Lathamaheswari, Yasar Mahmood, Nivetha Martin, Adrian Mărgean, Octavian Melinte, Mingcong Deng, Marcel Migdalovici, Monika Moga, Sana Moin, Mohamed Abdel-Basset, Mohamed Elhoseny, Rehab Mohamed, Mohamed Talea, Kalyan Mondal, Muhammad Aslam, Muhammad Aslam Malik, Muhammad Ihsan, Muhammad Naveed Jafar, Muhammad Rayees Ahmad, Muhammad Saeed, Muhammad Saqlain, Muhammad Shabir, Mujahid Abbas, Mumtaz Ali, Radu I. Munteanu, Ghulam Murtaza, Munazza Naz, Tahsin Oner, ‪Gabrijela Popović‬‬‬‬‬, Surapati Pramanik, R. Priya, S.P. Priyadharshini, Midha Qayyum, Quang-Thinh Bui, Shazia Rana, Akbara Rezaei, Jesús Estupiñán Ricardo, Rıdvan Sahin, Saeeda Mirvakili, Said Broumi, A. A. Salama, Flavius Aurelian Sârbu, Ganeshsree Selvachandran, Javid Shabbir, Shio Gai Quek, Son Hoang Le, Florentin Smarandache, Dragiša Stanujkić, S. Sudha, Taha Yasin Ozturk, Zaigham Tahir, The Houw Iong, Ayse Topal, Alptekin Ulutaș, Maikel Yelandi Leyva Vázquez, Rizha Vitania, Luige Vlădăreanu, Victor Vlădăreanu, Ștefan Vlăduțescu, J. Vimala, Dan Valeriu Voinea, Adem Yolcu, Yongfei Feng, Abd El-Nasser H. Zaied, Edmundas Kazimieras Zavadskas.‬‬. (shrink)

In this paper, a modified form of Collatz conjecture for neutrosophic numbers n ∈ (Z U I) is defined. We see for any n ∈ (Z U I) the related sequence using the formula (3a + 1) + (3b + 1)I converges to any one of the 55 elements mentioned in this paper. Using the akin formula of Collatz conjecture viz. (3a- 1) + (3b -1)I the neutrosophic numbers converges to any one of the 55 elements mentioned with appropriate modifications. (...) Thus, it is conjectured that every n ∈ (Z U I) has a finite sequence which converges to any one of the 55 elements. (shrink)

Smarandache in 2019 has generalized the algebraic structures to NeutroAlgebraic structures and AntiAlgebraic structures. In this paper, authors, for the first time, define the NeutroAlgebra of neutrosophic triplets group under usual+ and x, built using {Zn, x}, n a composite number, 5 < n < oo, which are not partial algebras. As idempotents in Zn alone are neutrals that contribute to neutrosophic triplets groups, we analyze them and build NeutroAlgebra of idempotents under usual + and x, which are not partial (...) algebras. We prove in this paper the existence theorem for NeutroAlgebra of neutrosophic triplet groups. This proves the neutrals assocaited with neutrosophic triplet groups in { Zn, X} under product is a NeutroAlgebra of triplets. We also prove the non-existence theorem of NeutroAlgebra for neutrosophic triplets in case of Zn when n = 2p, 3p and 4p (for some primes p). Several open problems are proposed. Further, the NeutroAlgebras of extended neutrosophic triplet groups have been obtained. (shrink)

In 1980 F. Wattenberg constructed the Dedekind completion

d of the Robinson non-archimedean field

and established basic algebraic properties of

d [6]. In 1985 H. Gonshor established further fundamental properties of

d [7].In [4] important construction of summation of countable sequence of Wattenberg numbers was proposed and corresponding basic properties of such summation were considered. In this paper the important applications of the Dedekind completion

d in transcendental number theory were considered. We dealing using set theory ZFC
(
-model of ZFC).Given (...) an class of analytic functions of one complex variable f  

z, we investigate the arithmetic nature of the values of fz at transcendental points en, n  .Main results are: (i) the both numbers e
 and e   are irrational, (ii) number ee is transcendental. Nontrivial generalization of the Lindemann- Weierstrass theorem is obtained. (shrink)

This analysis shows Cantor's diagonal definition in his 1891 paper was not compatible with his horizontal enumeration of the infinite set M. The diagonal sequence was a counterfeit which he used to produce an apparent exclusion of a single sequence to prove the cardinality of M is greater than the cardinality of the set of integers N.

Peter Godfrey-Smith writes in the section 3.3 “The Ravens Problem” of his book “Theory and Reality” [chapter “Induction and Confirmation”]: “First, the logical empiricists were concerned to deal with the case where generalizations cover an infinite number of instances. In that case, as we see each raven we are not reducing the number of ways in which the hypothesis might fail”. Infinite sets and finite sets have different properties and follow different rules. For example: let’s call “bag X” (...) a specific bag that contains 90 marbles; the generalization A “All marbles in bag X are red” covers a finite number of instances. By contrast, the generalization AE “All things that are not red are not marbles in bag X” covers an infinite number of instances. The propositions A and AE are logically equivalent, but there is an asymmetry due to the fact that A can only have a finite number of instances (since the set of the marbles contained in bag X is a finite set). Because of the aforementioned asymmetry, even though A and AE are logically equivalent propositions, it is wrong to equate an instance of A with an instance of AE. Another example involving a finite set: let’s call “barrique X” a certain 205-liter (54.1553 US gal) barrique. In the following generalization, the expression "all minerals" should not be understood as "all types of minerals", but should be understood literally as "all minerals". B “All minerals are in barrique X”. BE “All objects that are not in barrique X are not minerals”. Of course, a 205-litre barrique cannot contain an infinite number of minerals; the set of objects contained in barrique X is a finite set: therefore in the generalization B we refer to a set that is assumed to be an infinite set (the set of minerals) and to a set (the finite set of minerals contained in barrique X) that is not assumed to be an infinite set. By contrast, in the generalization BE we refer to two sets that are assumed to be infinite sets (the set of all objects that are not contained in barrique X and the set of all objects that are not minerals). Therefore, although B and BE are logically equivalent propositions, an instance of BE cannot be equivalent to an instance of B. Now, let’s analyze the following generalizations. C “All the elements of the set of ravens are elements of the set of black ravens”. CE “All the things that are not elements of the set of black ravens are not elements of the set of ravens”. It is assumed that the number of ravens is infinite, but it is not assumed that the number of black ravens is infinite: that the number of black ravens is infinite is only a hypothesis (for which confirmation is sought), it cannot be assumed as true that the number of black ravens is infinite. Therefore, in the generalization C we refer to a set that is assumed to be an infinite set (the set of ravens) and to a set (the set of black ravens) that is not assumed to be an infinite set. By contrast, in the generalization CE we refer to two sets that are assumed to be infinite sets (the set of all objects that are not elements of the set of black ravens and the set of all objects that are not elements of the set of ravens). Someone could argue that in the generalizations C “All the elements of the set of ravens are elements of the set of black ravens” and CE “All the things that are not elements of the set of black ravens are not elements of the set of ravens” only the set of ravens is assumed to be infinite: but even in this case an asymmetry would remain because C “ All the elements of the set of ravens are elements of the set of black ravens” refers to a set (the set of ravens) that is assumed to be an infinite set and to a set (the set of black ravens) that is not assumed to be infinite; by contrast, CE “All the things that are not elements of the set of black ravens are not elements of the set of ravens” in this case would refer to two sets that are not assumed to be infinite sets. Because of the aforementioned asymmetries, an instance of C cannot be equivalent to an instance of CE. -/- -/- . (shrink)

The way, in which quantum information can unify quantum mechanics (and therefore the standard model) and general relativity, is investigated. Quantum information is defined as the generalization of the concept of information as to the choice among infinite sets of alternatives. Relevantly, the axiom of choice is necessary in general. The unit of quantum information, a qubit is interpreted as a relevant elementary choice among an infinite set of alternatives generalizing that of a bit. The invariance to the (...) axiom of choice shared by quantum mechanics is introduced: It constitutes quantum information as the relation of any state unorderable in principle (e.g. any coherent quantum state before measurement) and the same state already well-ordered (e.g. the well-ordered statistical ensemble of the measurement of the quantum system at issue). This allows of equating the classical and quantum time correspondingly as the well-ordering of any physical quantity or quantities and their coherent superposition. That equating is interpretable as the isomorphism of Minkowski space and Hilbert space. Quantum information is the structure interpretable in both ways and thus underlying their unification. Its deformation is representable correspondingly as gravitation in the deformed pseudo-Riemannian space of general relativity and the entanglement of two or more quantum systems. The standard model studies a single quantum system and thus privileges a single reference frame turning out to be inertial for the generalized symmetry [U(1)]X[SU(2)]X[SU(3)] “gauging” the standard model. As the standard model refers to a single quantum system, it is necessarily linear and thus the corresponding privileged reference frame is necessary inertial. The Higgs mechanism U(1) → [U(1)]X[SU(2)] confirmed enough already experimentally describes exactly the choice of the initial position of a privileged reference frame as the corresponding breaking of the symmetry. The standard model defines ‘mass at rest’ linearly and absolutely, but general relativity non-linearly and relatively. The “Big Bang” hypothesis is additional interpreting that position as that of the “Big Bang”. It serves also in order to reconcile the linear standard model in the singularity of the “Big Bang” with the observed nonlinearity of the further expansion of the universe described very well by general relativity. Quantum information links the standard model and general relativity in another way by mediation of entanglement. The linearity and absoluteness of the former and the nonlinearity and relativeness of the latter can be considered as the relation of a whole and the same whole divided into parts entangled in general. (shrink)

Ultrafilters are very important mathematical objects in mathematical research [6, 22, 23]. There are a wide variety of classical theorems in various branches of mathematics where ultrafilters are applied in their proof, and other classical theorems that deal directly with ultrafilters. The objective of this article is to contribute (in a divulgative way) to ultrafilter research by describing the demonstrations of some such theorems related (uniquely or in combination) to topology, Measure Theory, algebra, combinatorial infinite, set theory and first-order (...) logic, also formulating some updated open problems of set theory that refer to non-principal ultrafilters on N, the Mathias’s model and the Solovay’s model. -/- Resumen: Los ultrafiltros son objetos matemáticos muy importantes en la investigación matemática [6, 22, 23]. Existen una gran variedad de teoremas clásicos en diversas ramas de la matemática donde se aplican ultrafiltros en su demostración, y otros teoremas clásicos que tratan directamente sobre ultrafiltros. El objetivo de este artículo es contribuir (de una manera divulgativa) con la investigación sobre ultrafiltros describiendo las demostraciones de algunos de tales teoremas relacionados (de manera única o combinada) con topología, teoría de la medida, álgebra, combinatoria infinita, teoría de conjuntos y lógica de primer orden, formulando además algunos problemas abiertos actuales de la teoría de conjuntos que se refieren a ultrafiltros no principales sobre N, al Modelo de Mathias y al Modelo de Solovay. (shrink)

The history of western philosophy is split to its core by a long-standing, fundamental dispute. On the one hand there are the so-called empiricists, like Locke, Berkeley, Hume, Mill, Russell, the logical positivists, A. J. Ayer, Karl Popper and most scientists, who hold empirical considerations alone can be appealed to in justifying, or providing a rationale for, claims to factual knowledge, there being no such thing as a priori knowledge – items of factual knowledge that are accepted on grounds other (...) than the empirical. And on the other hand there are the so-called rationalists, like Descartes, Spinoza, Leibniz, Bradley, McTaggart, who hold that a priori knowledge does exist, and even plays a crucial role in science. This long-standing dispute is resolved by the line of thought developed in this essay. The empiricists were right to deny the existence of a priori knowledge where this means factual knowledge of apodictic certainty justified independently of any appeal to experience. They were wrong, however, to deny the existence of a priori knowledge where this means conjectural items of factual knowledge whose acceptance is justified independently of any appeal to experience. Science requires there to be a priori knowledge in this latter sense, and two items of such knowledge will be exhibited. In addition to resolving this empiricist/rationalist dispute, the essay also develops a new conception of science – aim-oriented empiricism – and solves the long-standing problem of what it means to say of a theory that it is unified or explanatory. Furthermore, aim-oriented empiricism does not just change our conception of science; it requires that science itself needs to change. Science needs to become much more like the 17th century conception of natural philosophy, intermingling consideration of testable theories with consideration of untestable metaphysical, epistemological and methodological ideas. The whole relationship between science and the philosophy of science is transformed. The philosophy of science, construed as the exploration and critical assessment of rival ideas about what the aims and methods of science ought to be, ceases to be a meta-discipline, and becomes an integral part of science – or natural philosophy – itself. (shrink)

The purpose of this paper is to explore infinite sets and classes by mean hyperoperations. With ideal notion, the idea of extending infinite sets is as large as those objects. In this paper, extensions with hyperoperations are realized, like factorial, derivative, integral and operations between vector spaces. The ideas about infinite and count are enlarged.

Suppose one has a system, the infinite set of positive integers, P, and one wants to study the characteristics of a subset (or subsystem) of that system, the infinite subset of odd positives, O, relative to the overall system. In mathematics, this is done by pairing off each odd with a positive, using a function such as O=2P+1. This puts the odds in a one-to-one correspondence with the positives, thereby, showing that the subset of odds and the original (...) set of positives are the same size, or have the same cardinality. This counter-intuitive result ignores the “natural” relationship of one odd for every two positives in the sequence of positive integers, which would suggest that O is one-half the size of P. However, in the set of axioms that constitute mathematics, it is considered valid. Fair enough. In the physical universe (i.e., the starting system), though, relationships between entities matter. In biochemistry, if you start with an organism, say a rat, and you want to study its heart, you can do this by removing some heart cells and studying them in isolation in a cell culture system. But, the results often differ compared to what occurs in the intact animal because studying the isolated cultured cells ignores the relationships in the intact body between the cells, the rest of the heart tissue and the rest of the rat. In chemistry, if a copper atom were studied in isolation, it would never be known that copper atoms in bulk can conduct electricity because the atoms share their electrons. In physics, the relationships between inertial reference frames in relativity, and observer and observed in quantum physics can't be ignored. Relationships matter in the physical world, but the mathematics of infinite sets is still used to describe it. Does this matter? It seems to, at least in physics. Infinities cause numerous problems in theoretical physics such as non-renormalizability and problems in unifying quantum mehanics and general relativity . This suggests that the pairing off method and the mathematics of infinite sets based on it are analogous to a cell culture system or studying a copper atom in isolation if they are used in studying the physical universe because they ignore the inherent relationships between entities. In the real, physical world, the natural, inherent, relationships between entities can't be ignored. Said another way, the set of axioms that constitute abstract mathematics may be similar but not identical to the set of physical axioms by which the real, physical universe runs. This suggests that the results from abstract mathematics about infinities may not apply to or should be modified for use in physics. (shrink)

Chapin reviewed this 1972 ZEITSCHRIFT paper that proves the completeness theorem for the logic of variable-binding-term operators created by Corcoran and his student John Herring in the 1971 LOGIQUE ET ANALYSE paper in which the theorem was conjectured. This leveraging proof extends completeness of ordinary first-order logic to the extension with vbtos. Newton da Costa independently proved the same theorem about the same time using a Henkin-type proof. This 1972 paper builds on the 1971 “Notes on a Semantic Analysis of (...) Variable Binding Term Operators” (Co-author John Herring), Logique et Analyse 55, 646–57. MR0307874 (46 #6989). A variable binding term operator (vbto) is a non-logical constant, say v, which combines with a variable y and a formula F containing y free to form a term (vy:F) whose free variables are exact ly those of F, excluding y. Kalish-Montague 1964 proposed using vbtos to formalize definite descriptions “the x: x+x=2”, set abstracts {x: F}, minimization in recursive function theory “the least x: x+x>2”, etc. However, they gave no semantics for vbtos. Hatcher 1968 gave a semantics but one that has flaws described in the 1971 paper and admitted by Hatcher. In 1971 we give a correct semantic analysis of vbtos. We also give axioms for using them in deductions. And we conjecture strong completeness for the deductions with respect to the semantics. The conjecture, proved in this paper with Hatcher’s help, was proved independently about the same time by Newton da Costa. (shrink)

Looking at the recent spate of claims about “fake news” which appear to be a new feature of political discourse, I argue that fake news presents an interesting problem in epistemology. Te phenomena of fake news trades upon tolerating a certain indiference towards truth, which is sometimes expressed insincerely by political actors. Tis indiference and insincerity, I argue, has been allowed to fourish due to the way in which we have set the terms of the “public” epistemology that maintains what (...) is considered “rational” public discourse. I argue one potential salve to the problem of fake news is to challenge this public epistemology by injecting a certain ethical consideration back into the discourse. (shrink)

-/- A variable binding term operator (vbto) is a non-logical constant, say v, which combines with a variable y and a formula F containing y free to form a term (vy:F) whose free variables are exact ly those of F, excluding y. -/- Kalish-Montague proposed using vbtos to formalize definite descriptions, set abstracts {x: F}, minimalization in recursive function theory, etc. However, they gave no sematics for vbtos. Hatcher gave a semantics but one that has flaws. We give a correct (...) semantic analysis of vbtos. We also give axioms for using them in deductions. And we conjecture strong completeness for the deductions with respect to the semantics. The conjecture was later proved independently by the authors and by Newton da Costa. -/- The expression (vy:F) is called a variable bound term (vbt). In case F has only y free, (vy:F) has the syntactic propreties of an individual constant; and under a suitable interpretation of the language vy:F) denotes an individual. By a semantic analysis of vbtos we mean a proposal for amending the standard notions of (1) "an interpretation o f a first -order language" and (2) " the denotation of a term under an interpretation and an assignment", such that (1') an interpretation o f a first -order language associates a set-theoretic structure with each vbto and (2') under any interpretation and assignment each vb t denotes an individual. (shrink)

Belief in conspiracy theories is typically considered irrational, and as a consequence of this, conspiracy theorists––those who dare believe some conspiracy theory––have been charged with a variety of epistemic or psychological failings. Yet recent philosophical work has challenged the view that belief in conspiracy theories should be considered as typically irrational. By performing an intra-group analysis of those people we call “conspiracy theorists”, we find that the problematic traits commonly ascribed to the general group of conspiracy theorists turn out to (...) be merely a set of stereotypical behaviours and thought patterns associated with a purported subset of that group. If we understand that the supposed prob- lem of belief in conspiracy theories is centred on the beliefs of this purported sub- set––the conspiracists––then we can reconcile the recent philosophical contribu- tions to the wider academic debate on the rationality of belief in conspiracy theories. (shrink)

A set D subset of V(G) is a dominating set of a graph G if for all x ϵ V(G)\D, for some y ϵ D such that xy ϵ E(G). A dominating set D subset of V(G) is called a connected dominating set of a graph G if the subgraph <D> induced by D is connected. A connected domination number of G, denoted by γ_c(G), is the minimum cardinality of a connected dominating set D. The triple repetition sequence denoted by (...) {S_n:n ϵ Z+} is a sequence of positive integers which is repeated thrice, i.e., {S_n}={1,1,1,2,2,2,3,3,3, ...}. In this paper, we construct a combinatorial explicit formula for the triple repetition sequence of connected domination numbers of a triangular grid graph. (shrink)

Exclusionary defeat is Joseph Raz’s proposal for understanding the more complex, layered structure of practical reasoning. Exclusionary reasons are widely appealed to in legal theory and consistently arise in many other areas of philosophy. They have also been subject to a variety of challenges. I propose a new account of exclusionary reasons based on their justificatory role, rejecting Raz’s motivational account and especially contrasting exclusion with undercutting defeat. I explain the appeal and coherence of exclusionary reasons by appeal to commonsense (...) value pluralism and the intermediate space of public policies, social roles, and organizations. We often want our choices to have a certain character or instantiate a certain value and in order to do so, that choice can only be based on a restricted set of reasons. Exclusion explains how pro tanto practical reasons can be disqualified from counting towards a choice of a particular kind without being outweighed or undercut. (shrink)

I develop a cognitive account of how humans make skeptical judgments (of the form “X does not know p”). In my view, these judgments are produced by a special purpose metacognitive "skeptical" mechanism which monitors our reasoning for hasty or overly risky assumptions. I argue that this mechanism is modular and shaped by natural selection. The explanation for why the mechanism is adaptive essentially relies on an internalized principle connecting knowledge and action, a principle central to pragmatic encroachment theories. I (...) end the paper by sketching how we can use the account I develop here to respond to the skeptic. (shrink)

Abstract Most discussions of risk are developed in broadly consequentialist terms, focusing on the outcomes of risks as such. This paper will provide an alternative account of risk from a virtue ethical perspective, shifting the focus to the decision to take the risk. Making ethical decisions about risk is, we will argue, not fundamentally about the actual chain of events that the decision sets in process, but about the reasonableness of the decision to take the risk in the first place. (...) A virtue ethical account of risk is needed because the notion of the ‘reasonableness’ of the decision to take the risk is affected by the complexity of the moral status of particular instances of risk-taking and the risk-taker’s responsiveness to these contextual features. The very idea of ‘reasonable risk’ welcomes judgments about the nature of the risk itself, raises questions about complicity, culpability and responsibility, while at its heart, involves a judgement about the justification of risk which unavoidably focuses our attention on the character of the individuals involved in risk making decisions. Keywords: Risk; ethics; morality; responsibility; virtue; choice; reasons . (shrink)

The essays collected in this special issue explore what legitimacy means for actors and institutions that do not function like traditional states but nevertheless wield significant power in the global realm. They are connected by the idea that the specific purposes of non-state actors and the contexts in which they operate shape what it means for them to be legitimate and so shape the standards of justification that they have to meet. In this introduction, we develop this guiding methodology further (...) and show how the special issue’s individual contributions apply it to their cases. In the first section, we provide a sketch of our purpose-dependent theory of legitimacy beyond the state. We then highlight two features of the institutional context beyond the state that set it apart from the domestic case: problems of feasibility and the structure of international law. (shrink)

Recently, research on uncertainty modeling is progressing rapidly and many essential and breakthrough stud ies have already been done. There are various ways such as fuzzy, intuitionistic and neutrosophic sets to handle these uncertainties. Although these concepts can handle incomplete information in various real-world issues, they cannot address all types of uncertainty such as indeterminate and inconsistent information. Also, plithogenic sets as a generalization of crisp, fuzzy, intuitionistic fuzzy, and neutrosophic sets, which is a set whose elements are characterized by (...) many attributes’ values. In this paper, our aim is to demonstrate and review the history of fuzzy, intuitionistic and neutrosophic sets. For this purpose, we divided the paper as: section 1. History of Fuzzy Sets, section 2. History of Intuitionistic Fuzzy Sets and section 3. History of Neutrosophic Theories and Applications, section 4. History of Plithogenic Sets. (shrink)

Answer Set Programming is a new paradigm based on logic programming. The main component of answer set programming is a system that finds the answer sets of logic programs. During the computation of an answer set, systems are faced with choice points where they have to select a literal and assign it a truth value. Generally, systems utilize some heuristics to choose new literals at the choice points. The heuristic used is one of the key factors for the performance of (...) the system. A new heuristic for answer set programming has been developed. This heuristic is inspired by hierarchical planning. The notion of criticality, which was introduced for generating abstraction hierarchies in hierarchical planning, is used in this heuristic. The resulting system (CSMODELS) uses this new heuristic in a static way. CSMODELS is based on the system SMODELS. The experimental results show that this new heuristic is promising for answer set programming. A comparison of search times with SMODELS demonstrate CSMODELS’ usefulness. (shrink)

Suppose that we repair a wooden ship by replacing its planks one by one with new ones while at the same time reconstructing it using the discarded planks. Some defenders of vague or indeterminate identity claim that: (1) although the reconstructed ship is distinct from the repaired ship, it is indeterminate whether the original ship is the reconstructed ship and indeterminate whether it is the repaired ship, and (2) the indeterminacy is due to the world and not just an imprecision (...) in the language used to describe the situation. I argue that such a description is incoherent. The argument has two features. First, it differs in spirit from Gareth Evans's more general famous proof against the possibility of indeterminate identity. This is because I rely on facts regarding counting and sets. Second, I focus on Terence Parsons's recent defence of indeterminate identity. I argue that his attempts at making sense of counting objects involving indeterminate identities fail on technical and philosophical grounds. (shrink)

In this paper, we defend Socratic studies as a research programme against several recent attacks, including at least one recently published in Polis. Critics have argued that the study of Socrates, based upon evidence mostly or entirely derived from some set of Plato’s dialogues, is sfounded upon faulty and indefensible historical or hermeneutical technique. We begin by identifying what we believe are the foundational principles of Socratic studies, as the field has been pursued in recent years, and we then show (...) how the research programme that derives from accepting these principles is not defeated by any of the most common recent criticisms of it. Specifically, we argue that challenges to sorting Plato’s dialogues by date, more general challenges to historicist interpretations of Plato’s dialogues, as well as recent literary criticisms of Socratic studies all fail to undermine the research programme. We conclude with some thoughts about how and why Socratic studies has proved itself a valuable and fruitful research programme. (shrink)

Contrary to the widely accepted consensus, Christopher Heath Wellman argues that there are no pre-institutional judicial procedural rights. Thus commonly affirmed rights like the right to a fair trial cannot be assumed in the literature on punishment and legal philosophy as they usually are. Wellman canvasses and rejects a variety of grounds proposed for such rights. I answer his skepticism by proposing two novel grounds for procedural rights. First, a general right against unreasonable risk of punishment grounds rights to an (...) institutionalized system of punishment. Second, to complement and extend the first ground, I more controversially propose a right to provision of the robust good of security. People have a right to others' protecting for avoiding wrongfully harming them: when I take an action that is reasonably expected to threaten the protected interests of others, I must take appropriate care to avoid setting back those interests. Inflicting punishment on someone--intentionally harming them in response to a violation--is prima facie wrongful, so I can only count as taking appropriate care in punishing when I follow familiar procedures that reliably and redundantly test whether they are liable to such punishment, i.e. whether they have forfeited their right against punishment through a culpable act. (shrink)

Andrew Wiles' analytic proof of Fermat's Last Theorem FLT, which appeals to geometrical properties of real and complex numbers, leaves two questions unanswered: (i) What technique might Fermat have used that led him to, even if only briefly, believe he had `a truly marvellous demonstration' of FLT? (ii) Why is x^n+y^n=z^n solvable only for n<3? In this inter-disciplinary perspective, we offer insight into, and answers to, both queries; yielding a pre-formal proof of why FLT can be treated as a true (...) arithmetical proposition (one which, moreover, might not be provable formally in the first-order Peano Arithmetic PA), where we admit only elementary (i.e., number-theoretic) reasoning, without appeal to analytic properties of real and complex numbers. We cogently argue, further, that any formal proof of FLT needs---as is implicitly suggested by Wiles' proof---to appeal essentially to formal geometrical properties of formal arithmetical propositions. (shrink)

The scope of Platonism is extended by introducing the concept of a “Platonic computer” which is incorporated in metacomputics. The theoretical framework of metacomputics postulates that a Platonic computer exists in the realm of Forms and is made by, of, with, and from metaconsciousness. Metaconsciousness is defined as the “power to conceive, to perceive, and to be self-aware” and is the formless, con-tentless infinite potentiality. Metacomputics models how metaconsciousness generates the perceived actualities including abstract entities and physical and nonphysical (...) realities. It is postulated that this is achieved via digital computation using the Platonic computer. The introduction of a Platonic computer into the realm of Forms thus bridges the “inverse explanatory gap” and therefore solves the “inverse hard problem of consciousness” in the philosophy of mind. (shrink)

Daniel Isaacson has advanced an epistemic notion of arithmetical truth according to which the latter is the set of truths that we grasp on the basis of our understanding of the structure of natural numbers alone. Isaacson’s thesis is then the claim that Peano Arithmetic (PA) is the theory of finite mathematics, in the sense that it proves all and only arithmetical truths thus understood. In this paper, we raise a challenge for the thesis and show how it can be (...) overcome. We introduce the concept of purity for theories of arithmetic: a theory of arithmetic is pure when it only proves arithmetical truths. Then, we argue that, under Isaacson’s thesis, some PA-provable truths—including transfinite induction claims for infinite ordinals and some consistency statements—are seemingly not arithmetical in Isaacson’s sense, and hence that Isaacson’s thesis might entail the impurity of PA. Nonetheless, we conjecture that the advocate of Isaacson’s thesis can avoid this undesirable consequence: the arithmetical nature, as understood by Isaacson, of all contentious PA-provable statements can be justified. As a case study, we explore how this is done for transfinite induction claims with infinite ordinals below ε0. To this end, we show that the PA-proof of such claims employs exclusively resources from finite mathematics, and that ordinals below ε0 are finitary objects despite being infinite. (shrink)

Roughly, the noetic account characterizes scientific progress in terms of increased understanding. This chapter outlines a version of the noetic account according to which scientific progress on some phenomenon consists in making scientific information publicly available so as to enable relevant members of society to increase their understanding of that phenomenon. This version of the noetic account is briefly compared with four rival accounts of scientific progress, viz. the truthlikeness account, the problem-solving account, the new functional account, and the epistemic (...) account. In addition, the chapter seeks to precisify the question that accounts of scientific progress are (or should be) aiming to answer, viz. “What type of cognitive change with respect to a given topic or phenomenon X constitutes a (greater or lesser degree of) scientific improvement with respect to X?”. (shrink)

Reasoning from negative evidence takes place where an expected outcome is tested for, and when it is not found, a conclusion is drawn based on the significance of the failure to find it. By using Gricean maxims and implicatures, we show how a set of alternatives, which we call a paradigm, provides the deep inferential structure on which reasoning from lack of evidence is based. We show that the strength of reasoning from negative evidence depends on how the arguer defines (...) his conclusion and what he considers to be in the paradigm of negated alternatives. If we negate only two of the several possible alternatives, even if they are the most probable, the conclusion will be weak. However, if we deny all possible alternatives, the reasoning will be strong, and even in some cases deductively valid. (shrink)

In this paper, a metaphysics is proposed that includes everything that can be represented by a well-founded multiset. It is shown that this metaphysics, apart from being self-explanatory, is also benevolent. Paradoxically, it turns out that the probability that we were born in another life than our own is zero. More insights are gained by inducing properties from a metaphysics that is not self-explanatory. In particular, digital metaphysics is analyzed, which claims that only computable things exist. First of all, it (...) is shown that digital metaphysics contradicts itself by leading to the conclusion that the shortest computer program that computes the world is infinitely long. This means that the Church-Turing conjecture must be false. Secondly, the applicability of Occam’s razor is explained by evolution: in an evolving physics it can appear at each moment as if the world is caused by only finitely many things. Thirdly and most importantly, this metaphysics is benevolent in the sense that it organizes itself to fulfill the deepest wishes of its observers. Fourthly, universal computers with an infinite memory capacity cannot be built in the world. And finally, all the properties of the world, both good and bad, can be explained by evolutionary conservation. (shrink)

Rhinoceros beetle (Xylotrupes taprobanes ganesha) Silvestre, 2003 recently recorded from Nilgiri hills,Western Ghats. The distribution of this species were reported from Kerala and Tamil Nadu regions so far here after no works were done in this subspecies distribution so for in this region. This present observation ensure the occurrence of X. Taprobanes Ganesha in the Nilgiris show a light on this species ecological work in this region.

A general mathematical framework, based on countable partitions of Natural Numbers [1], is presented, that allows to provide a Semantics to propositional languages. It has the particularity of allowing both the valuations and the interpretation Sets for the connectives to discriminate complexity of the formulas. This allows different adequacy criteria to be used to assess formulas associated with the same connective, but that differ in their complexity. The presented method can be adapted potentially infinite number of connectives and truth (...) values, therefore, it can be considered a general framework to provide semantics to several of the known logic systems (eg, LC, L3 LP, FDE). The presented semantics allow to converge to different standard semantics if the separation complexity procedure is annulled. Therefore, it can be understood as a framework that allows greater precision (in complexity terms) with respect to formula satisfaction. Naturally, because of how it is built, it can be incorporated into non-deterministic semantics. The presented procedure also allows generating valuations that grant a different truth value to each formula of propositional language. As a positive side effect, our method allows a constructive proof of the equipotence between N and N^n for all Natural n. (shrink)

This article describes the system of patterning involved in the distribution of prime numbers. The description of the system is based on the idea that two seemingly independent process are interacting in a non-dimensional state. And since the language of mathematical formulation is syntactically dimensional, it cannot describe the system as a whole. If we accept advance predictability as proof of the system in connection with viewing a model of the regularity of its relationships, rather than relying on a traditionally (...) formulated mathematical proof, the rigorous system of prime distribution is clearly evident. The philosophical implications are significant, since it points to a weakness in mathematical language and the formulation of mathematical proofs. -/- *This draft is based on ideas published in the author's memoir "The Image of Language" 2021:Artists Books Editions. It is planned to be published in a book by the author tentatively titled "Archetivity.". (shrink)

We can have credences in an infinite number of propositions—that is, our opinion set can be infinite. Accuracy-first epistemologists have devoted themselves to evaluating credal states with the help of the concept of ‘accuracy’. Unfortunately, under several innocuous assumptions, infinite opinion sets yield several undesirable results, some of which are even fatal, to accuracy-first epistemology. Moreover, accuracy-first epistemologists cannot circumvent these difficulties in any standard way. In this regard, we will suggest a non-standard approach, called a relativistic (...) approach, to accuracy-first epistemology and show that such an approach can successfully circumvent undesirable results while having some advantages over the standard approach. (shrink)

This paper presents the design and development of an Android Grocery Management App aimed at simplifying the process of grocery shopping and inventory management for users. The app allows users to manage their grocery list, track inventory, set reminders for grocery purchases, and receive product suggestions. It also features integration with online stores for easy purchasing. The app is built with an emphasis on usability, providing an intuitive interface for seamless interaction.

A person with one dollar is poor. If a person with n dollars is poor, then so is a person with n + 1 dollars. Therefore, a person with a billion dollars is poor. True premises, valid reasoning, a false a conclusion. This is an instance of the Sorites-paradox. (There are infinitely many such paradoxes. A man with an IQ of 1 is unintelligent. If a man with an IQ of n is unintelligent, so is a man with an IQ (...) of n+1. Therefore a man with an IQ of 200 is unintelligent.) Most attempts to solve this paradox reject some law of classical logic, usually the law of bivalence. I show that this paradox can be solved while holding on to all the laws of classical logic. Given any predicate that generates a Sorites-paradox, significant use of that predicate is actually elliptical for a relational statement: a significant token of "Bob is poor" means that Bob is poor compared to x, for some value of x. Once a value of x is supplied, a definite cutoff line between having and not having the paradox-generating predicate is supplied. This neutralizes the inductive step in the associated Sorites argument, and the would-be paradox is avoided. (shrink)

A natural extension of Heron's 2000 year old formula for the area of a triangle to the volume of a tetrahedron is presented. This gives the fourth power of the volume as a polynomial in six simple rational functions of the areas of its four faces and three medial parallelograms, which will be referred to herein as "interior faces." Geometrically, these rational functions are the areas of the triangles into which the exterior faces are divided by the points at which (...) the tetrahedron's in-sphere touches those faces. Part I presents an overview of these results and some necessary but little-known background in areal geometry. Part II derives the promised extension, and ends with a conjecture as to how the formula extends to n-dimensional simplices for all n>3. Part III explains how, for n=3, the zeros of the polynomial constitute a five-dimensional semi-algebraic variety consisting almost entirely of collinear tetrahedra with vertices separated by infinite distances, but with generically well-defined distance ratios; it further proves that these unconventional Euclidean configurations can be identified with a quotient of the Klein quadric by an action of a group of reflections isomorphic to ℤ42, wherein four-point configurations in the affine plane constitute a distinguished three-dimensional subvariety. Part IV consists of five appendices which show, among other things, that the algebraic structure of the zeros in the affine plane naturally defines the associated four-element, rank 3 chirotope, aka affine oriented matroid. (shrink)

The Fundamental Sequence of Reality: Awareness as the First Cause Abstract The nature of reality has long been debated in philosophy, physics, and cosmology. The dominant paradigm suggests that physical reality emerged through energy interactions following the Big Bang. However, this paper proposes a fundamental shift in perspective: that awareness is the first cause of existence, preceding time, action, energy, and matter. This model aligns with modern quantum mechanics, neuroscience, and ancient metaphysical thought, providing a framework that unifies scientific and (...) philosophical inquiries. This paper explores how awareness initiates creation, the role of time as a coordination system rather than a force, the activation of energy as a response to directed motion, and the emergence of physical reality as the final effect. 1. Introduction The current scientific model postulates that the universe began with a singularity—an infinitely dense state that expanded to form all matter and energy. However, this theory does not explain what existed before the singularity or what caused it to activate. Additionally, the problem of consciousness remains unresolved in science, with competing theories about whether it is emergent or fundamental. This paper presents a new model where awareness exists as the first cause, setting the foundation for all subsequent phenomena. 2. Awareness as the First Cause 2.1 Defining Awareness as a Pre-Physical Reality Awareness, in this model, is not an emergent property of matter but an intrinsic state of existence. This idea is supported by: Orchestrated Objective Reduction (Orch-OR) Theory (Penrose & Hameroff, 2014): It suggests that consciousness exists in a quantum superposition before neural activity occurs, meaning it is fundamental rather than a byproduct of brain processes. The Observer Effect in Quantum Mechanics: The Double-Slit Experiment demonstrates that particles behave as waves until observed, implying that awareness plays a role in the formation of reality (Wheeler, 1983). Philosophical Idealism: Thinkers like Kant, Berkeley, and Chalmers have suggested that perception structures reality rather than reality existing independently. 2.2 Awareness Preceding Physical Existence Since awareness exists independently of time and space, it does not require a cause. The fundamental realization of awareness results in self-questioning, which initiates the unfolding of structured existence. 3. Time as a Coordination System, Not a Primary Force 3.1 Julian Barbour’s “End of Time” Hypothesis Barbour (1999) argues that time is not fundamental but is an emergent property of change. This aligns with: Einstein’s relativity, which shows that time is relative and can be influenced by motion and gravity. Quantum mechanics, which demonstrates that quantum events do not require a linear passage of time. 3.2 Time as a Measurement, Not a Cause This model suggests that time exists to coordinate the unfolding of awareness into structured phenomena, not as a force that causes motion. 4. Energy Release as a Reaction, Not a Primary Cause 4.1 Feynman’s Quantum Electrodynamics (QED) Feynman (1985) demonstrated that energy exists in a probability state until an interaction forces it into action. This means: Energy is not a first principle; it is activated through directed action. The vacuum state of the universe holds dormant energy that is only triggered when conditions allow it. 4.2 The Activation of Energy Energy is released only when awareness initiates action. Without awareness directing the process, energy remains in an unmanifested state. 5. Physical Reality as the Last Step 5.1 The Holographic Principle Physicists such as Gerard ‘t Hooft and Leonard Susskind propose that the universe is a projection of lower-dimensional information. This means: Matter is not fundamental; it emerges as a consequence of deeper, pre-physical structures. Awareness shapes reality at a fundamental level before material existence. 5.2 Consciousness & Quantum Gravity Penrose suggests that wave function collapse is influenced by gravitational effects, implying a connection between consciousness and spacetime itself. 6. Addressing Contradictory Theories 6.1 The Standard Big Bang Model The Big Bang assumes energy was the first principle, but it does not explain why energy became active. This model fixes that issue by proposing that awareness initiates energy release. 6.2 The Copenhagen Interpretation of Quantum Mechanics The Copenhagen Interpretation states that wave function collapse occurs when observed but does not define the observer. This model proposes that awareness is the ultimate observer, explaining why quantum states collapse into defined reality. 7. Implications for Science & Human Understanding This model unifies: Quantum Mechanics & Consciousness: Awareness as a fundamental principle aligns with quantum observation. Physics & Philosophy: Idealism meets empirical research in a coherent framework. Cosmology & Metaphysics: The origin of the universe is explained beyond materialist assumptions. 8. Conclusion By placing awareness as the first cause, we create a framework that bridges science, philosophy, and quantum mechanics. This model explains the missing elements in modern physics and provides a foundation for future exploration. 9. References Barbour, J. (1999). The End of Time: The Next Revolution in Physics. Bohr, N. (1928). "The Quantum Postulate and the Recent Development of Atomic Theory." Nature. Chalmers, D. J. (1995). "Facing up to the problem of consciousness." Journal of Consciousness Studies. Einstein, A. (1915). "General Theory of Relativity." Feynman, R. P. (1985). QED: The Strange Theory of Light and Matter. Guth, A. H. (1981). "Inflationary universe: A possible solution to the horizon and flatness problems." Physical Review D. Penrose, R. & Hameroff, S. (2014). "Consciousness in the universe: A review of the ‘Orch OR’ theory." Physics of Life Reviews. Susskind, L. (1995). "The World as a Hologram." Journal of Mathematical Physics. Wheeler, J. A. (1983). "Law without law." Quantum Theory and Measurement. (shrink)

Interoperability across data sets is a key challenge for quantitative histopathological imaging. There is a need for an ontology that can support effective merging of pathological image data with associated clinical and demographic data. To foster organized, cross-disciplinary, information-driven collaborations in the pathological imaging field, we propose to develop an ontology to represent imaging data and methods used in pathological imaging and analysis, and call it Quantitative Histopathological Imaging Ontology – QHIO. We apply QHIO to breast cancer hot-spot detection with (...) the goal of enhancing reliability of detection by promoting the sharing of data between image analysts. (shrink)

There is a well-known equivalence between avoiding accuracy dominance and having probabilistically coherent credences (see, e.g., de Finetti 1974, Joyce 2009, Predd et al. 2009, Pettigrew 2016). However, this equivalence has been established only when the set of propositions on which credence functions are defined is finite. In this paper, I establish connections between accuracy dominance and coherence when credence functions are defined on an infinite set of propositions. In particular, I establish the necessary results to extend the classic (...) accuracy argument for probabilism to certain classes of infinite sets of propositions including countably infinite partitions. (shrink)

It is well known that the following features hold of AR + T under the strong Kleene scheme, regardless of the way the language is Gödel numbered: 1. There exist sentences that are neither paradoxical nor grounded. 2. There are 2ℵ0 fixed points. 3. In the minimal fixed point the weakly definable sets (i.e., sets definable as {n∣ A(n) is true in the minimal fixed point where A(x) is a formula of AR + T) are precisely the Π1 1 sets. (...) 4. In the minimal fixed point the totally defined sets (sets weakly defined by formulae all of whose instances are true or false) are precisely the ▵1 1 sets. 5. The closure ordinal for Kripke's construction of the minimal fixed point is ωCK 1. In contrast, we show that under the weak Kleene scheme, depending on the way the Gödel numbering is chosen: 1. There may or may not exist nonparadoxical, ungrounded sentences. 2. The number of fixed points may be any positive finite number, ℵ0, or 2ℵ0 . 3. In the minimal fixed point, the sets that are weakly definable may range from a subclass of the sets 1-1 reducible to the truth set of AR to the Π1 1 sets, including intermediate cases. 4. Similarly, the totally definable sets in the minimal fixed point range from precisely the arithmetical sets up to precisely the ▵1 1 sets. 5. The closure ordinal for the construction of the minimal fixed point may be ω, ωCK 1, or any successor limit ordinal in between. In addition we suggest how one may supplement AR + T with a function symbol interpreted by a certain primitive recursive function so that, irrespective of the choice of the Godel numbering, the resulting language based on the weak Kleene scheme has the five features noted above for the strong Kleene language. (shrink)

Photo by Jonathan Ford on Unsplash ABSTRACT Since 2008, an average of twenty million people per year have been displaced by weather events. Climate migration creates a special setting for a duty to rescue. A duty to rescue is a moral rather than legal duty and imposes on a bystander to take an active role in preventing serious harm to someone else. This paper analyzes the idea of expanding a duty to rescue to climate migration. We address who should have (...) the duty and to whom the duty should extend. The paper discusses ways to define and apply the duty to rescue as well as its limitations, arguing that it may take the form of an ethical duty to prepare. (shrink)

The aim of the paper is to analyze the expressive power of the square operator of Łukasiewicz logic: ∗x=x⊙x⁠, where ⊙ is the strong Łukasiewicz conjunction. In particular, we aim at understanding and characterizing those cases in which the square operator is enough to construct a finite MV-chain from a finite totally ordered set endowed with an involutive negation. The first of our main results shows that, indeed, the whole structure of MV-chain can be reconstructed from the involution and the (...) Łukasiewicz square operator if and only if the obtained structure has only trivial subalgebras and, equivalently, if and only if the cardinality of the starting chain is of the form n+1 where n belongs to a class of prime numbers that we fully characterize. Secondly, we axiomatize the algebraizable matrix logic whose semantics is given by the variety generated by a finite totally ordered set endowed with an involutive negation and Łukasiewicz square operator. Finally, we propose an alternative way to account for Łukasiewicz square operator on involutive Gödel chains. In this setting, we show that such an operator can be captured by a rather intuitive set of equations. (shrink)

That i) there is a somehow determined chronology of Plato’s dialogues among all the chronologies of the last century and ii) this theory is subject to many objections, are points this article intends to discuss. Almost all the main suggested chronologies of the last century agree that Parmenides and Theaetetus should be located after dialogues like Meno, Phaedo and Republic and before Sophist, Politicus, Timaeus, Laws and Philebus. The eight objections we brought against this arrangement claim that to place the (...) dialogues like Meno, Phaedo and Republic both immediately after the early ones and before Parmenides and Theaetetus is epistemologically and ontologically problematic. -/- Key Words: Plato; chronology; knowledge; being; Parmenides -/- Introduction While the ancient philosophers, doxographers and commentators from Aristotle onward considered, more or less, the question of the date and arrangement of the dialogues (cf. Irwin 2008, 77 n. 69), they would not observe a firm necessity to consider the progress of Plato’s theories in dialogues, maybe because they did not think of any essential shift in there. We might be able to say, nevertheless, that the most prominent feature of the ancient attitude to Plato was its peculiar attention to the Republic and the Timaeus as the most mature works in his philosophy and also the consideration of Laws as a later work. This tendency can be discovered from the general viewpoint of the first chronologies of the early 19th century after starting to deal with the issue. That Schleiermacher observed Republic as the culmination of Plato’s philosophy and as one of the latest dialogues besides Laws and Timaeus could reflex the implicit chronology of the tradition in the first mirrors it found. Another tendency in Schleiermacher is taking the triology of Theaetetus, Sophist and Politicus as relatively early. From the last quarter of 19th century onward, stylometry helped scholars to establish a new framework to constructa new arrangement between the dialogues. Based on stylistic as well as literary findings, Campbell (1867, xxxff.) argued for the closeness of the style of Sophist and Politicus with Timaeus, Critias, Philebus and Lawsthat, especially because of the certain evidence about this last dialogue’s lateness, led to the consideration of all as late dialogues. Almost every other stylistic effort after Campbell approved the similarities between Sophist and Politicus with Timaeus, Critias, Philebus and Laws. The result of all such investigations led to a new chronology that, despite some differences, has a fixed structure in all its appearances. 1. The Standard Chronology of the Dialogues The chronologies that are now commonly accepted are mostly based on the arrangement of dialogues to three groups corresponding to three periods of Plato’s life, which became predominant after applying stylistic features in assessing the similarities between dialogues. The fact that all the stylometric considerations reached to the similar results about the date of dialogues while they were assessing different stylistic aspects helped the new chronology become prevailing not only among stylistic chronologies but also between those like Fine, Kahn and Vlastos who were inclined more to the content-based arrangements. Even this latter group could not neglect the apparently certain results of using the method of stylometry. This was the main reason, I think, that made what they called content-based chronology be under the domination of stylometry much more than they could expect. The division of the dialogues into three separate groups became something that most of the scholars took for granted so far as Kahn thinks this division 'can be regarded as a fixed point of departure in any speculation about the chronology of the dialogues' (1996, 44). Thereafter, all the chronologists are accustomed to divide the dialogues to three groups of early, middle and late corresponding to the three stages of Plato’s life. Nevertheless, some of them tried to make subdivisions among each group and introduce some of the dialogues as transitional between different periods and thus reached to a fourfold classification of the dialogues. Although theycould never achieve to a consensus about the place of some dialogues, about which we will discuss soon, the whole spirit of theirchronological arrangements is the same and thus compelling enough for us to unify all of them with the label of 'Standard Chronology of Dialogues' (SCD). We brought together some of the most famous chronologies in the table below to make a comparison easier and to show how all are approximately of the same opinion about the place of some dialogues. The following points must be noted about this table: 1. I divided the dialogues to eight groups of early, late early, transitional, early middle, late middle, post-middle, early late, and late. Although none of the chronologists applies this classification, it can be helpful to compare them. In this table, for example, if one of the chronologist’s beholds one of the dialogues as later than all the dialogues of middle group, it is considered here as late middle. Otherwise, if it is emphasized that it is after all of them, it is considered as post-middle. The same is true about the dialogues of the late group in which I regarded the first dialogues of that period as early late only in those who explicitly considered some dialogues as earlier than other ones in the late group. Though, therefore, some of the dialogues might have not been considered as forming a distinct class, they are distinguished here. A. SCD’s Early and Transitional Dialogues When we move from stylometric to content-based chronologies, the homogeneity between the dialogues of each group is more understandable. Guthrie (1975, v. 4, 50) distinguishes three groups, the first of them includes Apology, Crito, Laches, Lysis, Charmides, Euthyphro, Hippias Minor, Hippias Major, Protagoras, Gorgiasand Ion. In addition to Meno, Phaedo and Euthydems, his first group does not include Cratylus and Menexenus. Unlike Guthrie, almost all the other content-based chronologiesof our study desire to distinguish two categories inside the first group of which the latter must be considered as the transitional group leading to the dialogues of the middle period. Kahn distinguishes four groups of dialogues and arranges two of them before middle period dialogues. The first group including Apology, Crito, Ion, Hippias Minor, Gorgiasand Menexenus he calls 'early' or 'presystematic' dialogues (1998, 124). The second group he calls the 'threshold', 'pre-middle' or 'Socratic' dialogues including seven: Laches, Charmides, Lysis, Euthyphro, Protagoras, Euthydemus and Meno. Based on Vlastos’ arrangement we must distinguish Euthydemus, Hippias Major, Lysis, Menexenus and Meno as 'transitional' dialogues from the 'elenctic' dialogues that are the other dialogues of Kahn’smentioned first two groups plus the first book of theRepublic. Fine also distinguishes 'transitional' dialogues from early or 'Socratic' dialogues,but her transitional dialogues are Gorgias, Meno, Hippias Major, Euthydemus and Cratylus of which she thinks the last two dialogues are 'controversial' (2003, 1). Her Socratic dialogues are all the remaining dialogues of Kahn’s first two groups. In spite of all the differences between the mentioned chronologies, it can be seen that all of them are inclined to arrange the early dialogues in a way that: i) Besides the dialogues that are considered as late, it never includes Republic II-X, Theaetetus, Phaedrus and Parmenides. ii) It intends to consider the dialogues like Euthydemus and Hippias Majorthat look more critical as later among the earlier dialogues or as transitional group. iii) Those who do not consider Meno as a middle period dialogue place it in their second or transitional group. iv) None of the content-based chronologies considers Phaedo and Symposium as early. Stylometric chronologies also intend to put them either as last dialogues among their early ones or as middle. B. SCD’s Middle Period Dialogues Campbell listed Republic, Phaedrus, Parmenides and Theaetetus as his second group of dialogues, an idea thatwas accepted by Brandwood. Ledger’smiddle period dialogueshad Euthydemus, Symposium and Cratylus in addition to the dialogues that Campbell and Brandwood had mentioned as middle. Among content-based chronologies, Guthrie’s list of middle period dialogues did not include Parmenides but some dialogues which had been considered as early in stylometric ones: Meno, Phaedo, Republic, Symposium, Phaedrus, Euthydemus, Menexenus and Cratylus. In sofar as I know, Euthydemus and Menexenus have not been considered as middle by other content-based chronologists and Guthrie is an exception among them. That Phaedo, Phaedrus, Symposium and Republic were middle period dialogues almost all the philosophical chronologists like Kahn, Fine, Vlastos (except Rep.I), Irwin andKraut came along. The dialogues they do not string along about are Meno, Cratylus, Parmenides and Theaetetus. Those like Guthrie, Kraut and Irwin who did not consider Meno as early presumably posit it among middles. The same can be said about Cratylus in the suggested chronologies of Guthrie, Kahn, Vlastos and Kraut. Nonetheless, it is different in case of Parmenides and Theaetetus. Whereas all the mentioned stylometric chronologists like Campbell, Brandwood and Ledger set them among middle period dialogues,the philosophical chronologists, it might seem at first, did not arrive at a consensus about them. While Guthrie and Fine put them as the first dialogues of the late group, Vlastos and Kraut set them as the latest of the middle group, as well as Kahn who puts them as post-middle and amongst the late period dialogues. Regardless the way they classify their groups, their disagreement does not affect the arrangement of the dialogues: they all posit Parmenides and Theaetetus after the series of Meno, Phaedo, Phaedrus, Symposium and Republic and before Sophist, Politicus, Timaeus, Philebus and Laws. To sum up SCD’s arrangement of the middle period dialogues we can add: v) Republic and Phaedrus have been considered by all the mentioned chronologists as dialogues of the middle period. vi) All the philosophical chronologies have reached a consensus about setting Phaedo and Symposium alongside with Republic and Phaedrus as middle. vii) While Stylometric alongside some philosophic chronologists arrange Parmenides and Theaetetus among their middle period dialogues and mostly as the latest among them, other philosophical chronologists put them as the early among the late dialogues. We can conclude then that SCD intends to locate these two dialogues at the boundary between the middle and late period dialogues. -/- . (shrink)