Areas of Mathematics

Let G be an additive subgroup of ℂ, let Wn = {xi = 1, xi + xj = xk: i, j, k ∈ {1, …, n }}, and define En = {xi = 1, xi + xj = xk, xi · xj = xk: i, j, k ∈ {1, …, n }}. We discuss two conjectures. If a system S ⊆ En is consistent over ℝ, then S has a real solution which consists of numbers whose absolute values belong to (...) [0, 22n –2]. If a system S ⊆ Wn is consistent over G, then S has a solution ∈ n in which |xj| ≤ 2n –1 for each j. (shrink)

Jerry Fodor, by common agreement, is one of the world’s leading philosophers. At the forefront of the cognitive revolution since the 1960s, his work has determined much of the research agenda in the philosophy of mind and the philosophy of psychology for well over 40 years. This special issue dedicated to his work is intended both as a tribute to Fodor and as a contribution to the fruitful debates that his work has generated. One philosophical thesis that has dominated Fodor’s (...) work since the 1960s is realism about the mental. Are there really mental states, events and processes? From his first book, Psychological Explanation (1968), onwards, Fodor has always answered this question with a resolute yes. From his early rejection of Wittgensteinian and behaviourist conceptions of the mind, to his later disputes with philosophers of mind of the elminativist ilk, he has always been opposed to views that try to explain away mental phenomena. On his view, there are minds, and minds can change the world. (shrink)

Over the last decade, multi-agent systems have come to form one of the key tech- nologies for software development. The Formal Approaches to Multi-Agent Systems (FAMAS) workshop series brings together researchers from the fields of logic, theoreti- cal computer science and multi-agent systems in order to discuss formal techniques for specifying and verifying multi-agent systems. FAMAS addresses the issues of logics for multi-agent systems, formal methods for verification, for example model check- ing, and formal approaches to cooperation, multi-agent planning, communication, (...) coordination, negotiation, games, and reasoning under uncertainty in a distributed environment. In 2007, the third FAMAS workshop, FAMAS'007, was one of the agent workshops gathered together under the umbrella of Multi-Agent Logics, Languages, and Organ- isations - Federated Workshops, MALLOW'007, taking place from 3 to 7 September 2007 in Durham. This current special issue of the Logic Journal of the IGPL gathers together the revised and updated versions of the five best FAMAS'007 contributions. (shrink)

To explore the extent of embeddability of Leibnizian infinitesimal calculus in first-order logic (FOL) and modern frameworks, we propose to set aside ontological issues and focus on pro- cedural questions. This would enable an account of Leibnizian procedures in a framework limited to FOL with a small number of additional ingredients such as the relation of infinite proximity. If, as we argue here, first order logic is indeed suitable for developing modern proxies for the inferential moves found in Leibnizian infinitesimal (...) calculus, then modern infinitesimal frameworks are more appropriate to interpreting Leibnizian infinitesimal calculus than modern Weierstrassian ones. (shrink)

I discuss Greg Restall’s attempt to generate an account of logical consequence from the incoherence of certain packages of assertions and denials. I take up his justification of the cut rule and argue that, in order to avoid counterexamples to cut, he needs, at least, to introduce a notion of logical form. I then suggest a few problems that will arise for his account if a notion of logical form is assumed. I close by sketching what I take to be (...) the most natural minimal way of distinguishing content and form and suggest further problems arising for this route. (shrink)

In ‘The Train Paradox’, I argued that sequential random selections from the natural numbers would grow through time. I used this claim to present a paradox. In response to this proposed paradox, Jon Pérez Laraudogoitia has argued that random selections from the natural numbers do not grow through time. In this paper, I defend and expand on the argument that random selections from the natural numbers grow through time. I also situate this growth of random selections in the context of (...) my overall work on infinite number, which involves two main claims: 1) infinite numbers, properly understood, are the infinite natural numbers in a nonstandard model of the reals, and 2) ω is potentially infinite. (shrink)

This note clarifies an error in the proof of the main theorem of “The Ricean Objection: An Analogue of Rice’s Theorem for First-Order Theories”, Logic Journal of the IGPL, 16(6): 585–590(2008).

Given a class of linear order types C, we identify and study several different classes of trees, naturally associated with C in terms of how the paths in those trees are related to the order types belonging to C. We investigate and completely determine the set-theoretic relationships between these classes of trees and between their corresponding first-order theories. We then obtain some general results about the axiomatization of the first-order theories of some of these classes of trees in terms of (...) the first-order theory of the generating class C, and indicate the problems obstructing such general results for the other classes. These problems arise from the possible existence of nondefinable paths in trees, that need not satisfy the first-order theory of C, so we have started analysing first order definable and undefinable paths in trees. (shrink)

In [5], Béziau provides a means by which Gentzen’s sequent calculus can be combined with the general semantic theory of bivaluations. In doing so, according to Béziau, it is possible to construe the abstract “core” of logics in general, where logical syntax and semantics are “two sides of the same coin”. The central suggestion there is that, by way of a modification of the notion of maximal consistency, it is possible to prove the soundness and completeness for any normal logic. (...) However, the reduction to bivaluation may be a side effect of the architecture of ordinary sequents, which is both overly restrictive, and entails certain expressive restrictions over the language. This paper provides an expansion of Béziau’s completeness results for logics, by showing that there is a natural extension of that line of thinking to n-sided sequent constructions. Through analogical techniques to Béziau’s construction, it is possible, in this setting, to construct abstract soundness and completeness results for n-valued logics. (shrink)

Between Giuseppe Peano and Camillo Berneri, a foremost protagonist of the Italian anarchist movement, an interesting correspondence was exchanged in the years 1925-1929. Along with a presentation of the correspondence, Peano's political attitude and the role of his international language projects in early 20th century Italian left are discussed.

A graph-theoretic account of fibring of logics is developed, capitalizing on the interleaving characteristics of fibring at the linguistic, semantic and proof levels. Fibring of two signatures is seen as a multi-graph (m-graph) where the nodes and the m-edges include the sorts and the constructors of the signatures at hand. Fibring of two models is a multi-graph (m-graph) where the nodes and the m-edges are the values and the operations in the models, respectively. Fibring of two deductive systems is an (...) m-graph whose nodes are language expressions and the m-edges represent the inference rules of the two original systems. The sobriety of the approach is confirmed by proving that all the fibring notions are universal constructions. This graph-theoretic view is general enough to accommodate very different fibrings of propositional based logics encompassing logics with non-deterministic semantics, logics with an algebraic semantics, logics with partial semantics and substructural logics, among others. Soundness and weak completeness are proved to be preserved under very general conditions. Strong completeness is also shown to be preserved under tighter conditions. In this setting, the collapsing problem appearing in several combinations of logic systems can be avoided. (shrink)

In this thesis we present two logical systems, $\bf MP$ and $\MP$, for the purpose of reasoning about knowledge and effort. These logical systems will be interpreted in a spatial context and therefore, the abstract concepts of knowledge and effort will be defined by concrete mathematical concepts.

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

We generalize and extend the class of Sahlqvist formulae in arbitrary polyadic modal languages, to the class of so called inductive formulae. To introduce them we use a representation of modal polyadic languages in a combinatorial style and thus, in particular, develop what we believe to be a better syntactic approach to elementary canonical formulae altogether. By generalizing the method of minimal valuations à la Sahlqvist–van Benthem and the topological approach of Sambin and Vaccaro we prove that all inductive formulae (...) are elementary canonical and thus extend Sahlqvist’s theorem over them. In particular, we give a simple example of an inductive formula which is not frame-equivalent to any Sahlqvist formula. Then, after a deeper analysis of the inductive formulae as set-theoretic operators in descriptive and Kripke frames, we establish a somewhat stronger model-theoretic characterization of these formulae in terms of a suitable equivalence to syntactically simpler formulae in the extension of the language with reversive modalities. Lastly, we study and characterize the elementary canonical formulae in reversive languages with nominals, where the relevant notion of persistence is with respect to discrete frames. (shrink)

In this article, I argue that it is impossible to complete infinitely many tasks in a finite time. A key premise in my argument is that the only way to get to 0 tasks remaining is from 1 task remaining, when tasks are done 1-by-1. I suggest that the only way to deny this premise is by begging the question, that is, by assuming that supertasks are possible. I go on to present one reason why this conclusion (that supertasks are (...) impossible) is important, namely that it implies a new verdict on a decision puzzle propounded by Jeffrey Barrett and Frank Arntzenius. (shrink)

The original purpose of the present study, 2011, started with a preprint «On the Probable Failure of the Uncountable Power Set Axiom», 1988, is to save from the transfinite deadlock of higher set theory the jewel of mathematical Continuum — this genuine, even if mostly forgotten today raison d’être of all traditional set-theoretical enterprises to Infinity and beyond, from Georg Cantor to David Hilbert to Kurt Gödel to W. Hugh Woodin to Buzz Lightyear.

We review Solomon Feferman's 1998 essay collection In The Light of Logic (Oxford University Press).

Can an epistemic conception of truth and an endorsement of the excluded middle (together with other principles of classical logic abandoned by the intuitionists) cohabit in a plausible philosophical view? In PART I I describe the general problem concerning the relation between the epistemic conception of truth and the principle of excluded middle. In PART II I give a historical overview of different attitudes regarding the problem. In PART III I sketch a possible holistic solution.

This paper is about Poincaré’s view of the foundations of geometry. According to the established view, which has been inherited from the logical positivists, Poincaré, like Hilbert, held that axioms in geometry are schemata that provide implicit definitions of geometric terms, a view he expresses by stating that the axioms of geometry are “definitions in disguise.” I argue that this view does not accord well with Poincaré’s core commitment in the philosophy of geometry: the view that geometry is the study (...) of groups of operations. In place of the established view I offer a revised view, according to which Poincaré held that axioms in geometry are in fact assertions about invariants of groups. Groups, as forms of the understanding, are prior in conception to the objects of geometry and afford the proper definition of those objects, according to Poincaré. Poincaré’s view therefore contrasts sharply with Kant’s foundation of geometry in a unique form of sensibility. According to my interpretation, axioms are not definitions in disguise because they themselves implicitly define their terms, but rather because they disguise the definitions which imply them. (shrink)

The paper is an introduction to geometric algebra and geometric calculus for those with a knowledge of undergraduate mathematics. No knowledge of physics is required. The section Further Study lists many papers available on the web.

The aim of this article is to investigate the roles of commutative diagrams (CDs) in a specific mathematical domain, and to unveil the reasons underlying their effectiveness as a mathematical notation; this will be done through a case study. It will be shown that CDs do not depict spatial relations, but represent mathematical structures. CDs will be interpreted as a hybrid notation that goes beyond the traditional bipartition of mathematical representations into diagrammatic and linguistic. It will be argued that one (...) of the reasons why CDs form a good notation is that they are highly mathematically tractable: experts can obtain valid results by ‘calculating’ with CDs. These calculations, take the form of ‘diagram chases’. In order to draw inferences, experts move algebraic elements around the diagrams. It will be argued that these diagrams are dynamic. It is thanks to their dynamicity that CDs can externalize the relevant reasoning and allow experts to draw conclusions directly by manipulating them. Lastly, it will be shown that CDs play essential roles in the context of proof as well as in other phases of the mathematical enterprise, such as discovery and conjecture formation. (shrink)

This article will consider imagination in mathematics from a historical point of view, noting the key moments in its conception during the ancient, modern and contemporary eras.

Typewritten notes on groups and geometry.

Context: Consistency of mathematical constructions in numerical analysis and the application of computerized proofs in the light of the occurrence of numerical chaos in simple systems. Purpose: To show that a computer in general and a numerical analysis in particular can add its own peculiarities to the subject under study. Hence the need of thorough theoretical studies on chaos in numerical simulation. Hence, a questioning of what e.g. a numerical disproof of a theorem in physics or a prediction in numerical (...) economics could mean. Method: An algebraic simple model system is subjected to a deeper structure of underlying variables. With an algorithm simulating the steps in taking a limit of second order difference quotients the error terms are studied at the background of their algebraic expression. Results: With the algorithm that was applied to a simple quadratic polynomial system we found unstably amplified round-off errors. The possibility of numerical chaos is already known but not in such a simple system as used in our paper. The amplification of the errors implies that it is not possible with computer means to constructively show that the algebra and numerical analysis will ‘on the long run’ converge to each other and the error term will vanish. The algebraic vanishing of the error term cannot be demonstrated with the use of the computer because the round-off errors are amplified. In philosophical terms, the amplification of the round-off error is equivalent to the continuum hypothesis. This means that the requirement of (numerical) construction of mathematical objects is no safeguard against inference-only conclusions of qualities of (numerical) mathematical objects. Unstably amplified round-off errors are a same type of problem as the ordering in size of transfinite cardinal numbers. The difference is that the former problem is created within the requirements of constructive mathematics. This can be seen as the reward for working numerically constructive. (shrink)

The existence of singularities alerts that one of the highest priorities of a centennial perspective on general relativity should be a careful re-thinking of the validity domain of Einstein’s field equations. We address the problem of constructing distinguishable extensions of the smooth spacetime manifold model, which can incorporate singularities, while retaining the form of the field equations. The sheaf-theoretic formulation of this problem is tantamount to extending the algebra sheaf of smooth functions to a distribution-like algebra sheaf in which the (...) former may be embedded, satisfying the pertinent cohomological conditions required for the coordinatization of all of the tensorial physical quantities, such that the form of the field equations is preserved. We present in detail the construction of these distribution-like algebra sheaves in terms of residue classes of sequences of smooth functions modulo the information of singular loci encoded in suitable ideals. Finally, we consider the application of these distribution-like solution sheaves in geometrodynamics by modeling topologically-circular boundaries of singular loci in three-dimensional space in terms of topological links. It turns out that the Borromean link represents higher order wormhole solutions. (shrink)

The paper is an introduction to geometric algebra and geometric calculus for those with a knowledge of undergraduate mathematics. No knowledge of physics is required. The section Further Study lists many papers available on the web.

The derivative is a basic concept of differential calculus. However, if we calculate the derivative as change in distance over change in time, the result at any instant is 0/0, which seems meaningless. Hence, Newton and Leibniz used the limit to determine the derivative. Their method is valid in practice, but it is not easy to intuitively accept. Thus, this article describes the novel method of differential calculus based on the double contradiction, which is easier to accept intuitively. Next, the (...) geometrical meaning of the double contradiction is considered as follows. A tangent at a point on a convex curve is iterated. Then, the slope of the tangent at the point is sandwiched by two kinds of lines. The first kind of line crosses the curve at the original point and a point to the right of it. The second kind of line crosses the curve at the original point and a point to the left of it. Then, the double contradiction can be applied, and the slope of the tangent is determined as a single value. Finally, the meaning of this method for the foundation of mathematics is considered. We reflect on Dehaene’s notion that the foundation of mathematics is based on the intuitions, which evolve independently. Hence, there may be gaps between intuitions. In fact, the Ancient Greeks identified inconsistency between arithmetic and geometry. However, Eudoxus developed the theory of proportion, which is equivalent to the Dedekind Cut. This allows the iteration of an irrational number by rational numbers as precisely as desired. Simultaneously, we can define the irrational number by the double contradiction, although its existence is not guaranteed. Further, an area of a curved figure is iterated and defined by rectilinear figures using the double contradiction. (shrink)

Filtration combustion is described by Laplacian growth without surface tension. These equations have elegant analytical solutions that replace the complex integro-differential motion equations by simple differential equations of pole motion in a complex plane. The main problem with such a solution is the existence of finite time singularities. To prevent such singularities, nonzero surface tension is usually used. However, nonzero surface tension does not exist in filtration combustion, and this destroys the analytical solutions. However, a more elegant approach exists for (...) solving the problem. First, we can introduce a small amount of pole noise to the system. Second, for regularisation of the problem, we throw out all new poles that can produce a finite time singularity. It can be strictly proved that the asymptotic solution for such a system is a single finger. Moreover, the qualitative consideration demonstrates that a finger with 1 2 of the channel width is statistically stable. Therefore, all properties of such a solution are exactly the same as those of the solution with nonzero surface tension under numerical noise. The solution of the ST problem without surface tension is similar to the solution for the equation of cellular flames in the case of the combustion of gas mixtures. (shrink)

John Corcoran. 1979 Review of Hintikka and Remes. The Method of Analysis (Reidel, 1974). Mathematical Reviews 58 3202 #21388. -/- The “method of analysis” is a technique used by ancient Greek mathematicians (and perhaps by Descartes, Newton, and others) in connection with discovery of proofs of difficult theorems and in connection with discovery of constructions of elusive geometric figures. Although this method was originally applied in geometry, its later application to number played an important role in the early development of (...) algebra [Jacob Klein, English translation, Greek mathematical thought and the origin of algebra, especially pp. 154–157, M.I.T. Press, Cambridge, Mass., 1968]. -/- It is universally agreed that the method of analysis begins by “assuming the thing sought after” (e.g., in geometry, the truth of the proposition to be proved or the existence of the geometric figure to be constructed). Aside from this, little else can be taken for granted. There is disagreement concerning the “direction of analysis”, i.e. whether one is to seek implications of the assumption or whether one is to seek implicants of it. There is also disagreement concerning what is to be “anatomized” (analyzed), i.e., whether one analyzes mathematical objects (figures), mathematical propositions (the axioms, known theorems, and analytic assumption) or an imagined proof (of the analytic assumption from axioms and known theorems). (shrink)

In this papers ,we generalize some results of other authors to weighted spaces and gain the boundedness of maximal Bochner-Riesz operator on weighted Herz-Hardy spaces,weighted Hardy spaces and weighted weak Hardy spaces ,where $\omega \in A_1.$.

In this papers ,we use the control method of the maximal fractional integral and obtain the boundedness of higher order commutator generated by maximal Bochner-Riesz operator on Morrey space. Moreover , we get it's continuty from Morrey space to Lipschtz space and from Morrey space to BMO space.

In this paper, I present a puzzle involving special relativity and the random selection of real numbers. In a manner to be specified, darts thrown later hit reals further into a fixed well-ordering than darts thrown earlier. Special relativity is then invoked to create a puzzle. I consider four ways of responding to this puzzle which, I suggest, fail. I then propose a resolution to the puzzle, which relies on the distinction between the potential infinite and the actual infinite. I (...) suggest that certain structures, such as a well-ordering of the reals, or the natural numbers, are examples of the potential infinite, whereas infinite integers in a nonstandard model of arithmetic are examples of the actual infinite. (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)

Context: Consistency of mathematical constructions in numerical analysis and the application of computerized proofs in the light of the occurrence of numerical chaos in simple systems. Purpose: To show that a computer in general and a numerical analysis in particular can add its own peculiarities to the subject under study. Hence the need of thorough theoretical studies on chaos in numerical simulation. Hence, a questioning of what e.g. a numerical disproof of a theorem in physics or a prediction in numerical (...) economics could mean. Method: An algebraic simple model system is subjected to a deeper structure of underlying variables. With an algorithm simulating the steps in taking a limit of second order difference quotients the error terms are studied at the background of their algebraic expression. Results: With the algorithm that was applied to a simple quadratic polynomial system we found unstably amplified round-off errors. The possibility of numerical chaos is already known but not in such a simple system as used in our paper. The amplification of the errors implies that it is not possible with computer means to constructively show that the algebra and numerical analysis will ‘on the long run’ converge to each other and the error term will vanish. The algebraic vanishing of the error term cannot be demonstrated with the use of the computer because the round-off errors are amplified. In philosophical terms, the amplification of the round-off error is equivalent to the continuum hypothesis. This means that the requirement of (numerical) construction of mathematical objects is no safeguard against inference-only conclusions of qualities of (numerical) mathematical objects. Unstably amplified round-off errors are a same type of problem as the ordering in size of transfinite cardinal numbers. The difference is that the former problem is created within the requirements of constructive mathematics. This can be seen as the reward for working numerically constructive. (shrink)

Categorical foundations and set-theoretical foundations are sometimes presented as alternative foundational schemes. So far, the literature has mostly focused on the weaknesses of the categorical foundations. We want here to concentrate on what we take to be one of its strengths: the explicit identification of so-called canonical maps and their role in mathematics. Canonical maps play a central role in contemporary mathematics and although some are easily defined by set-theoretical tools, they all appear systematically in a categorical framework. The key (...) element here is the systematic nature of these maps in a categorical framework and I suggest that, from that point of view, one can see an architectonic of mathematics emerging clearly. Moreover, they force us to reconsider the nature of mathematical knowledge itself. Thus, to understand certain fundamental aspects of mathematics, category theory is necessary (at least, in the present state of mathematics). (shrink)

(Recipient of the 2020 Everett Mendelsohn Prize.) This article revisits the development of the protoplasm concept as it originally arose from critiques of the cell theory, and examines how the term “protoplasm” transformed from a botanical term of art in the 1840s to the so-called “living substance” and “the physical basis of life” two decades later. I show that there were two major shifts in biological materialism that needed to occur before protoplasm theory could be elevated to have equal status (...) with cell theory in the nineteenth century. First, I argue that biologists had to accept that life could inhere in matter alone, regardless of form. Second, I argue that in the 1840s, ideas of what formless, biological matter was capable of dramatically changed: going from a “coagulation paradigm” that had existed since Theophrastus, to a more robust conception of matter that was itself capable of movement and self-maintenance. In addition to revisiting Schleiden and Schwann’s original writings on cell theory, this article looks especially closely at Hugo von Mohl’s definition of the protoplasm concept in 1846, how it differed from his primordial utricle theory of cell structure two years earlier. This article draws on Lakoff and Johnson’s theory of “ontological metaphors” to show that the cell, primordial utricle, and protoplasm can be understood as material container, object, and substance, and that these overlapping distinctions help explain the chaotic and confusing early history of cell theory. (shrink)

Category theory has foundational importance because it provides conceptual lenses to characterize what is important and universal in mathematics—with adjunctions being the primary lens. If adjunctions are so important in mathematics, then perhaps they will isolate concepts of some importance in the empirical sciences. But the applications of adjunctions have been hampered by an overly restrictive formulation that avoids heteromorphisms or hets. By reformulating an adjunction using hets, it is split into two parts, a left and a right semiadjunction. Semiadjunctions (...) (essentially a formulation of universal mapping properties using hets) can then be combined in a new way to define the notion of a brain functor that provides an abstract model of the intentionality of perception and action (as opposed to the passive reception of sense-data or the reflex generation of behavior). (shrink)

By extending Husserl’s own historico-critical study to include the conceptual mathematics of more contemporary times – specifically category theory and its emphatic development since the second half of the 20th century – this paper claims that the delineation between mathematics and philosophy must be completely revisited. It will be contended that Husserl’s phenomenological work was very much influenced by the discoveries and limitations of the formal mathematics being developed at Göttingen during his tenure there and that, subsequently, the rôle he (...) envisaged for his material a priori science is heavily dependent upon his conception of the definite manifold. Motivating these contentions is the idea of a mathematics which would go beyond the constraints of formal ontology and subsequently achieve coherence with the full sense of transcendental phenomenology. While this final point will be by no means proven within the confines of this paper it is hoped that the very fact of opening up for the possibility of such an idea will act as a supporting argument to the overriding thesis that the relationship between mathematics and phenomenology must be problematised. (shrink)

This essay endeavors to define the concept of indefinite extensibility in the setting of category theory. I argue that the generative property of indefinite extensibility in the category-theoretic setting is identifiable with the Kripke functors of modal coalgebraic automata, where the automata model Grothendieck Universes and the functors are further inter-definable with the elementary embeddings of large cardinal axioms. The Kripke functors definable in Grothendieck universes are argued to account for the ontological expansion effected by the elementary embeddings in the (...) category of sets. By characterizing the modal profile of Ω-logical validity, and thus the generic invariance of mathematical truth, modal coalgebraic automata are further capable of capturing the notion of definiteness, in order to yield a non-circular definition of indefinite extensibility. (shrink)

This paper responds to recent work in the philosophy of Homotopy Type Theory by James Ladyman and Stuart Presnell. They consider one of the rules for identity, path induction, and justify it along ‘pre-mathematical’ lines. I give an alternate justification based on the philosophical framework of inferentialism. Accordingly, I construct a notion of harmony that allows the inferentialist to say when a connective or concept is meaning-bearing and this conception unifies most of the prominent conceptions of harmony through category theory. (...) This categorical harmony is stated in terms of adjoints and says that any concept definable by iterated adjoints from general categorical operations is harmonious. Moreover, it has been shown that identity in a categorical setting is determined by an adjoint in the relevant way. Furthermore, path induction as a rule comes from this definition. Thus we arrive at an account of how path induction, as a rule of inference governing identity, can be justified on mathematically motivated grounds. (shrink)

The Elementary Process Theory (EPT) is a collection of seven elementary process-physical principles that describe the individual processes by which interactions have to take place for repulsive gravity to exist. One of the two main problems of the EPT is that there is no proof that the four fundamental interactions (gravitational, electromagnetic, strong, and weak) as we know them can take place in the elementary processes described by the EPT. This paper sets forth the method by which it can be (...) proven that the EPT agrees with the knowledge that derives from the successful predictions of a modern interaction theory T. This determines a fundamentally new research program in theoretical physics. (shrink)

Modern categorical logic as well as the Kripke and topological models of intuitionistic logic suggest that the interpretation of ordinary “propositional” logic should in general be the logic of subsets of a given universe set. Partitions on a set are dual to subsets of a set in the sense of the category-theoretic duality of epimorphisms and monomorphisms—which is reflected in the duality between quotient objects and subobjects throughout algebra. If “propositional” logic is thus seen as the logic of subsets of (...) a universe set, then the question naturally arises of a dual logic of partitions on a universe set. This paper is an introduction to that logic of partitions dual to classical subset logic. The paper goes from basic concepts up through the correctness and completeness theorems for a tableau system of partition logic. (shrink)