Let C be a small Barr-exact category, Reg the category of all regular functors from C to the category of small sets. A form of M. Barr's full embedding theorem states that the evaluation functor e : C →[Reg, Set ] is full and faithful. We prove that the essential image of e consists of the functors that preserve all small products and filtered colimits. The concept of κ-Barr-exact category is introduced, for κ any infinite regular cardinal, (...) and the natural generalization to κ-Barr-exact categories of the above result is proved. The treatment combines methods of model theory and category theory. Some applications to module categories are given. (shrink)

The paper sets out to offer an alternative to the function/argument approach to the most essential aspects of natural language meanings. That is, we question the assumption that semantic completeness (of, e.g., propositions) or incompleteness (of, e.g., predicates) exactly replicate the corresponding grammatical concepts (of, e.g., sentences and verbs, respectively). We argue that even if one gives up this assumption, it is still possible to keep the compositionality of the semantic interpretation of simple predicate/argument structures. In our opinion, compositionality presupposes (...) that we are able to compare arbitrary meanings in term of information content. This is why our proposal relies on an ‘intrinsically’ type free algebraic semantic theory. The basic entities in our models are neither individuals, nor eventualities, nor their properties, but ‘pieces of evidence’ for believing in the ‘truth’ or ‘existence’ or ‘identity’ of any kind of phenomenon. Our formal language contains a single binary non-associative constructor used for creating structured complex terms representing arbitrary phenomena. We give a finite Hilbert-style axiomatisation and a decision algorithm for the entailment problem of the suggested system. (shrink)

We suggest a new approach for addressing the problem of establishing an axiomatic foundation for large cardinals. An axiom asserting the existence of a large cardinal can naturally be viewed as a strong Axiom of Infinity. However, it has not been clear on the basis of our knowledge of ω itself, or of generally agreed upon intuitions about the true nature of the mathematical universe, what the right strengthening of the Axiom of Infinity is—which large cardinals ought to be derivable? (...) It was shown in the 1960s by Lawvere that the existence of an infinite set is equivalent to the existence of a certain kind of structure-preserving transformation from V to itself, not isomorphic to the identity. We use Lawvere's transformation, rather than ω, as a starting point for a reasonably natural sequence of strengthenings and refinements, leading to a proposed strong Axiom of Infinity. A first refinement was discussed in later work by Trnková—Blass, showing that if the preservation properties of Lawvere's tranformation are strengthened to the point of requiring it to be an exact functor , such a transformation is provably equivalent to the existence of a measurable cardinal. We propose to push the preservation properties as far as possible, short of inconsistency. The resulting transformation V→V is strong enough to account for virtually all large cardinals, but is at the same time a natural generalization of an assertion about transformations V→V known to be equivalent to the Axiom of Infinity. (shrink)

Finitary quasivarieties are characterized categorically by the existence of colimits and of an abstractly finite, regularly projective regular generator G. Analogously, infinitary quasivarieties are characterized: one drops the assumption that G be abstractly finite. For (finitary) varieties the characterization is similar: the regular generator is assumed to be exactly projective, i.e., hom(G, –) is an exact functor. These results sharpen the classical characterization theorems of Lawvere, Isbell and other authors.

Rosen's modelling relations constitute a conceptual schema for the understanding of the bidirectional process of correspondence between natural systems and formal symbolic systems. The notion of formal systems used in this study refers to information structures constructed as algebraic rings of observable attributes of natural systems, in which the notion of observable signifies a physical attribute that, in principle, can be measured. Due to the fact that modelling relations are bidirectional by construction, they admit a precise categorical formulation in terms (...) of the category-theoretic syntactic language of adjoint functors, representing the inverse processes of information encoding/decoding via adjunctions. As an application, we construct a topological modelling schema of complex systems. The crucial distinguishing requirement between simple and complex systems in this schema is reflected with respect to their rings of observables by the property of global commutativity. The global information structure representing the behaviour of a complex system is modelled functorially in terms of its spectrum functor. An exact modelling relation is obtained by means of a complex encoding/decoding adjunction restricted to an equivalence between the category of complex information structures and the category of sheaves over a base category of partial or local information carriers equipped with an appropriate topology. (shrink)

One well known problem regarding quantifiers, in particular the 1st order quantifiers, is connected with their syntactic categories and denotations.The unsatisfactory efforts to establish the syntactic and ontological categories of quantifiers in formalized first-order languages can be solved by means of the so called principle of categorial compatibility formulated by Roman Suszko, referring to some innovative ideas of Gottlob Frege and visible in syntactic and semantic compatibility of language expressions. In the paper the principle is introduced for categorial languages generated (...) by the Ajdukiewicz’s classical categorial grammar. The 1st-order quantifiers are typically ambiguous. Every 1st-order quantifier of the type k > 0 is treated as a two-argument functor-function defined on the variable standing at this quantifier and its scope (the sentential function with exactly k free variables, including the variable bound by this quantifier); a binary function defined on denotations of its two arguments is its denotation. Denotations of sentential functions, and hence also quantifiers, are defined separately in Fregean and in situational semantics. They belong to the ontological categories that correspond to the syntactic categories of these sentential functions and the considered quantifiers. The main result of the paper is a solution of the problem of categories of the 1st-order quantifiers based on the principle of categorial compatibility. (shrink)

By recent work on some conjectures of Pillay, each definably compact group G in a saturated o-minimal expansion of an ordered field has a normal "infinitesimal subgroup" G00 such that the quotient G/G00, equipped with the "logic topology", is a compact (real) Lie group. Our first result is that the functor G → G/G00 sends exact sequences of definably compact groups into exact sequences of Lie groups. We then study the connections between the Lie group G/G00 and (...) the o-minimal spectrum G̃ of G. We prove that G/G00 is a topological quotient of G̃. We thus obtain a natural homomorphism ψ* from the cohomology of G/G00 to the (Čech-)cohomology of G̃. We show that if G00 satisfies a suitable contractibility conjecture then $\widetilde{G^{00}}$ is acyclic in Čech cohomology and ψ* is an isomorphism. Finally we prove the conjecture in some special cases. (shrink)

0. The ancient and honorable role of philosophy as a servant to the learning, development and use of scientific knowledge, though sadly underdeveloped since Grassmann, has been re-emerging from within the particular science of mathematics due to the latter's internal need; making this relationship more explicit (as well as further investigating the reasons for the decline) will, it is hoped, help to germinate the seeds of a brighter future for philosophy as well as help to guide the much wider learning (...) of mathematics and hence of all the sciences. 1. The unity of interacting opposites "space vs. quantity", with the accompanying "general vs. particular" and the resulting division of variable quantity into the interacting opposites "extensive vs. intensive", is susceptible, with the aid of categories, functors, and natural transformations, of a formulation which is on the one hand precise enough to admit proved theorems and considerable technical development and yet is on the other hand general enough to admit incorporation of almost any specialized hypothesis. Readers armed with the mathematical definitions of basic category theory should be able to translate the discussion in this section into symbols and diagrams for calculations. 2. The role of space as an arena for quantitative "becoming" underlies the qualitative transformation of a spatial category into a homotopy category, on which extensive and intensive quantities reappear as homology and cohomology. 3. The understanding of an object in a spatial category can be approached through definite Moore-Postnikov levels; each of these levels constitutes a mathematically precise "unity and identity of opposites", and their ensemble bears features strongly reminiscent of Hegel's Science of Logic. This resemblance suggests many mathematical and philosophical problems which now seem susceptible of exact solution. (shrink)

We pursue a model-oriented rather than axiomatic approach to the foundations of Quantum Mechanics, with the idea that new models can often suggest new axioms. This approach has often been fruitful in Logic and Theoretical Computer Science. Rather than seeking to construct a simplified toy model, we aim for a 'big toy model', in which both quantum and classical systems can be faithfully represented—as well as, possibly, more exotic kinds of systems. To this end, we show how Chu spaces can (...) be used to represent physical systems of various kinds. In particular, we show how quantum systems can be represented as Chu spaces over the unit interval in such a way that the Chu morphisms correspond exactly to the physically meaningful symmetries of the systems—the unitaries and antiunitaries. In this way we obtain a full and faithful functor from the groupoid of Hubert spaces and their symmetries to Chu spaces. We also consider whether it is possible to use a finite value set rather than the unit interval; we show that three values suffice, while the two standard possibilistic reductions to two values both fail to preserve fullness. (shrink)

We study the expressive power in the finite of the logic Fixed-Point+Counting, the extension of first-order logic which is obtained through adding both the fixed-point constructor and the ability to count. To this end an isomorphism preserving (`generic') model of computation is introduced whose PTime restriction exactly corresponds to this level of expressive power, while its PSpace restriction corresponds to While+Counting. From this model we obtain a normal form which shows a rather clear separation of the relational vs. the arithmetical (...) side of the algorithms involved. In parallel, we study the relations of Fixed-Point+Counting with the infinitary logics L r ∞ω (∃ ≥ m ) m∈ω and the corresponding pebble games. The main result, however, involves the concept of an arithmetical invariant. By this we mean a functor taking every finite relational structure to an expansion of (an initial segment of) the standard arithmetical structure. In particular its values are linearly ordered structures. We establish the existence of a family of arithmetical invariants (J r ) r≥ 1 with the following properties: $\bullet$ The invariants themselves can be evaluated in polynomial time. $\bullet$ A class of finite relational structures is definable in Fixed-Point+Counting if and only if membership can be decided in polynomial time on the basis of the values of one of the invariants. $\bullet$ The invariant J r classifies all finite relational structures exactly up to equivalence with respect to the logic L r ∞ω (∃ ≥ m ) m∈ω . We also give a characterization of Fixed-Point+Counting in terms of sequences of formulae in the L r ωω (∃ ≥ m ) m∈ω : It corresponds exactly to the polynomial time computable families (φ n ) n∈ω in these logics. Towards a positive assessment of the expressive power of Fixed-Point+Counting, it is shown that the natural extension of fixed-point logic by Lindström quantifiers, which capture all the PTime computable properties of cardinalities of definable predicates, is strictly weaker than what we get here. This implies in particular that every extension of fixed-point logic by means of monadic Lindstrom quantifiers, which stays within PTime, must be strictly contained in Fixed-Point+Counting. (shrink)

By utilizing the topological concept of pseudocompactness, we simplify and improve a proof of Caicedo, Dueñez, and Iovino concerning Terence Tao's metastability. We also pinpoint the exact relationship between the Omitting Types Theorem and the Baire Category Theorem by developing a machine that turns topological spaces into abstract logics.

We prove, by using the concept of schematic interpretation, that the natural embedding from the category ISL, of intuitionistic sentential pretheories and i-congruence classes of morphisms, to the category CSL, of classical sentential pretheories and c-congruence classes of morphisms, has a left adjoint, which is related to the double negation interpretation of Gödel-Gentzen, and a right adjoint, which is related to the Law of Excluded Middle. Moreover, we prove that from the left to the right adjoint there is a pointwise (...) epimorphic natural transformation and that since the two endofunctors at CSL, obtained by adequately composing the aforementioned functors, are naturally isomorphic to the identity functor for CSL, the string of adjunctions constitutes an adjoint cylinder. On the other hand, we show that the operators of Lindenbaum-Tarski of formation of algebras from pretheories can be extended to equivalences of categories from the category CSL, respectively, ISL, to the category Bool, of Boolean algebras, respectively, Heyt, of Heyting algebras. Finally, we prove that the functor of regularization from Heyt to Bool has, in addition to its well-known right adjoint (that is, the canonical embedding of Bool into Heyt) a left adjoint, that from the left to the right adjoint there is a pointwise epimorphic natural transformation, and, finally, that such a string of adjunctions constitutes an adjoint cylinder. (shrink)

The present paper attempts to provide an exact truthmaker semantical analysis of modalized propositions. According to the present proposal, an exact truthmaker for “Necessarily _P_” is a state that bans every exact truthmaker for “Not _P_”, and an exact truthmaker for “Possibly _P_” is a state that allows an exact truthmaker for _P_. Based on this proposal, a formal semantics will be developed; and the soundness and completeness results for a well-known family of the systems (...) of normal modal propositional logic will be established. It shall be seen that the present analysis offers an exactification of the standard Kripke semantics in the sense that it analyzes the accessibility relation between possible worlds in terms of the banning and allowing relations between the constituent states, and thereby gives an account of “truth at a possible world” in terms of exact truthmaking. (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)

In this document, we introduce a novel formalism for any field theory and apply it to the effective field theories of large-scale structure. The new formalism is based on functors of actions composing those theories. This new formalism predicts the actionic fields. We discuss our findings in a cosmological gravitology framework. We present these results with a cosmological inference approach and give guidelines on how we can choose the best candidate between those models with some latest understanding of model selection (...) using Bayesian inference. (shrink)

Physicien de formation, Francois Bastien a enseigne dans de nombreux domaines: mathematiques, electricite, optique, thermodynamique, physique des vibrations, physique des capteurs, acoustique des solides, informatique, electronique numerique et electrotechnique. Il a tenu un blog ou se sont regroupees certaines interrogations sur les sciences exactes. Son livre presente donc des reflexions sur la recherche scientifique. Un changement d'echelle de la communaute scientifique entraine necessairement un bouleversement. L'auteur tend a sortir de la doctrine hors de l'ecole point de salut qui freine la (...) promotion sociale, en proposant par exemple un Musee de la Science inconnue. Il invite egalement a lutter contre les effets de la multiplication des publications scientifiques, en faisant naitre des journaux de critiques scientifiques comme il en existe pour la litterature. Par ailleurs, la prise en compte des limites de la science, d'un point de vue philosophique et pratique, est discutee. (shrink)

There is some consensus among orthodox category theorists that the concept of adjoint functors is the most important concept contributed to mathematics by category theory. We give a heterodox treatment of adjoints using heteromorphisms that parses an adjunction into two separate parts. Then these separate parts can be recombined in a new way to define a cognate concept, the brain functor, to abstractly model the functions of perception and action of a brain. The treatment uses relatively simple category theory (...) and is focused on the interpretation and application of the mathematical concepts. (shrink)

The philosophy of science between the two world wars, 1920s-1930s.

There has recently been a revival of interest in panpsychism as a theory of consciousness. The hope of the contemporary proponents of panpsychism is that the view enables us to integrate consciousness into our overall theory of reality in a way that avoids the deep difficulties that plague the more conventional options of physicalism on the one hand and dualism on the other. However, panpsychism comes in two forms — strong and weak emergentist — and there are arguments that seem (...) to show that weak emergentist panpsychism faces problems analogous to those of physicalism whilst strong emergentist panpsychism faces problems analogous to those of dualism. In this paper, I will develop a new hybrid of the strong and weak emergentist forms of panpsychism, a view according to which subjects of experience are strongly emergent but their phenomenal properties are weakly emergent. I will argue that this hybrid view manages to avoid the challenges facing both physicalism and dualism, and the analogues of those challenges that seem to undermine standard forms of panpsychism. (shrink)

Fried and Kollár constructed a fully faithful functor from the category of graphs to the category of fields. We give a new construction of such a functor and use it to resolve a longstanding open problem in computable model theory, by showing that for every nontrivial countable structure${\cal S}$, there exists a countable field${\cal F}$of arbitrary characteristic with the same essential computable-model-theoretic properties as${\cal S}$. Along the way, we develop a new “computable category theory”, and prove that our (...) functor and its partially defined inverse are computable functors. (shrink)

Is calculation possible without language? Or is the human ability for arithmetic dependent on the language faculty? To clarify the relation between language and arithmetic, we studied numerical cognition in speakers of Mundurukú, an Amazonian language with a very small lexicon of number words. Although the Mundurukú lack words for numbers beyond 5, they are able to compare and add large approximate numbers that are far beyond their naming range. However, they fail in exact arithmetic with numbers larger than (...) 4 or 5. Our results imply a distinction between a nonverbal system of number approximation and a language-based counting system for exact number and arithmetic. (shrink)

It is often said that a person P knows the meaning of a sentence S if P knows S’ s truth-conditions, in the sense that given any possible world, P knows whether S is true in that world. This idea of sentence-meaning corresponds fairly closely to what Frege, Russell, Carnap, and other philosophers have had in mind in speaking of the senses, propositional contents, or “locutionary” meanings of sentences; and, not unnaturally, it has encouraged semanticists such as David Lewis, Robert (...) Stalnaker and Max Cresswell to suggest that sentence-meanings or propositions simply are functions from the set of possible worlds onto the truth-values. (shrink)

Given some links between Lyndon’s Interpolation Theorem, term distribution, and Sommers and Englebretsen’s logic, in this contribution we attempt to capture a sense of interpolation for Sommers and Englebretsen’s Term Functor Logic. In order to reach this goal we first expound the basics of Term Functor Logic, together with a sense of term distribution, and then we offer a proof of our main contribution.

Humans possess two nonverbal systems capable of representing numbers, both limited in their representational power: the first one represents numbers in an approximate fashion, and the second one conveys information about small numbers only. Conception of exact large numbers has therefore been thought to arise from the manipulation of exact numerical symbols. Here, we focus on two fundamental properties of the exact numbers as prerequisites to the concept of EXACT NUMBERS : the fact that all numbers (...) can be generated by a successor function and the fact that equality between numbers can be defined in an exact fashion. We discuss some recent findings assessing how speakers of Munduruc (an Amazonian language), and young Western children (3-4 years old) understand these fundamental properties of numbers. (shrink)

We construct a 2-equivalence \(\mathfrak {CohTheory}^{op }\simeq \mathfrak {TypeSpaceFunc}\). Here \(\mathfrak {CohTheory}\) is the 2-category of positive theories and \(\mathfrak {TypeSpaceFunc}\) is the 2-category of type space functors. We give a precise definition of interpretations for positive logic, which will be the 1-cells in \(\mathfrak {CohTheory}\). The 2-cells are definable homomorphisms. The 2-equivalence restricts to a duality of categories, making precise the philosophy that a theory is ‘the same’ as the collection of its type spaces (i.e. its type space (...) class='Hi'>functor). In characterising those functors that arise as type space functors, we find that they are specific instances of (coherent) hyperdoctrines. This connects two different schools of thought on the logical structure of a theory. The key ingredient, the Deligne completeness theorem, arises from topos theory, where positive theories have been studied under the name of coherent theories. (shrink)

There have been two parallel views regarding the role of voting in deliberation. The first is that deliberation before the fabrication of balloting was completely devoid of voting. The second is that voting is, not just part of deliberation, but is standard to deliberation. I argue in this article that neither of these views is correct. Implicit voting has always existed across time and space but only as a last resort in the event of a failure of natural unanimity. What (...) is relatively modern is the establishment of what I call explicit voting, namely, balloting, outside deliberation and often without deliberation. I also distinguish between natural and artificial unanimities, and clarify that artificial unanimities are products of implicit voting. I demonstrate these clarifications with some examples of deliberation. I deploy these clarifications to rid a certain debate of confusion regarding the precise role of voting in consensual deliberation. (shrink)

This paper is an attempt to solve the following problem: given a logic, how to turn it into a paraconsistent one? In other words, given a logic in which ex falso quodlibet holds, how to convert it into a logic not satisfying this principle? We use a framework provided by category theory in order to define a category of consequence structures. Then, we propose a functor to transform a logic not able to deal with contradictions into a paraconsistent one. (...) Moreover, we study the case of paraconsistentization of propositional classical logic. (shrink)

I defend, to a certain extent, the traditional view that perceptual indiscriminability is non-transitive. The argument proceeds by considering important recent work by Benj Hellie: Hellie argues that colour perception represents ‘inexactly’, and that this results in violations of the transitivity of colour indiscriminability. I show that Hellie’s argument remains inconclusive, since he does not demonstrate conclusively that colour perception really does represent inexactly. My own argument for the non-transitivity of perceptual indiscriminability uses inexactness instead as one horn of a (...) dilemma: the key idea is that there is a class of perceptual experiences which might plausibly be supposed either to represent inexactly or to represent exactly—but which demonstrate the non-transitivity of perceptual indiscriminability either way. (shrink)

Several Gentzen-style syntactic type calculi with product are considered. They form a hierarchy in such a way that one calculus results from another by imposing a new condition upon the sequent-forming operation. It turns out that, at some steps of this process, two different functors collapse to a single one. For the remaining stages of the hierarchy, analogues of Wajsbergs's theorem on non-mutual-definability are proved.

We prove a version of the associated sheaf functor theorem in Algebraic Set Theory. The proof is established working within a Heyting pretopos equipped with a system of small maps satisfying the axioms originally introduced by Joyal and Moerdijk. This result improves on the existing developments by avoiding the assumption of additional axioms for small maps and the use of collection sites.