O pensamento axiomático de Hilbert foi um influente modelo filosófico que motivou movimentos como o positivismo no início do século XX, em diversas áreas dentro, e fora, da filosofia, como a epistemologia e a metamatemática. O formalismo axiomático fornece, através do uso da lógica de primeira ordem, uma importante fundação para modelos lógicos formais, o que, para Hilbert, representaria um modelo universal de investigação empírica, não só para a matemática, mas para todas as ciências naturais, e pela visão positivista, também (...) a filosofia. Contudo, no caso mais específico da matemática, existe uma certa descomunicação entre os fundamentos da matemática e sua prática, onde métodos informais, ainda promovem elegantes ferramentas para matemáticos de diversas áreas, inclusive, quando certos paradigmas tentam ser quebrados. É exatamente esta assincronia entre os fundamentos da matemática, e a sua prática que iremos investigar neste estudo. Lawvere, insatisfeito com a “fundação não fundamentada” do método axiomático proposto por Hilbert, e inspirado pela dialética hegeliana, procurou revisar os fundamentos da matemática pela lógica categórica e a Teoria das Categorias. Vemos neste estudo, como as interpretações de Lawvere de conceitos da lógica de Hegel, como, equivalência, unidade dos opostos e “aufheben”, permitem uma nova abordagem matemática, com um posicionamento filosófico que procura, de certa forma, transcender a dicotomia entre escolas analíticas e continentais. Lawvere trata a lógica objetiva de Hegel como uma possível estratégia para resolver o problema de aterramento lógico em metafísica. Por fim, vemos como as contribuições de Lawvere para a axiomatização da lógica categórica tiveram impactos inovadores na metamatemática, especialmente no desenvolvimento das fundações univalentes de Vladimir Voevodsky. (shrink)

This paper offers an overview of various alternative formulations for Analysis, the theory of Integral and Differential Calculus, and its diverging conceptions of the topological structure of the continuum. We pay particularly attention to Smooth Analysis, a proposal created by William Lawvere and Anders Kock based on Grothendieck’s work on a categorical algebraic geometry. The role of Heyting’s logic, common to all these alternatives is emphasized.

The 'Science of Knowing: Mathematics' textbook is the first book to put forward and substantiate the thesis that the mathematical understanding of mathematics, as exemplified in F. William Lawvere's Functorial Semantics, constitutes the science of knowing i.e. cognitive science. -/- This is a textbook, i.e. teaching material.

At the intersection of category theory, cybernetics, and dialectical reasoning lies a profound framework for understanding computation and control. This paper examines how categorical structures—particularly adjoint functors and fixed points—illuminate the nature of feedback and control in both mathematical and philosophical contexts. Through an analysis of Lawvere’s fixed point theorem, Bayesian Open Games, and modern approaches to categorical cybernetics, we develop a unified perspective that bridges computation, control, and dialectical reasoning. We demonstrate the practical implications of this theoretical framework (...) through a compiler pipeline that targets modern GPU architectures. (shrink)

I explore the possibility of a structuralist interpretation of homotopy type theory (HoTT) as a foundation for mathematics. There are two main aspects to HoTT's structuralist credentials. First, it builds on categorical set theory (CST), of which the best-known variant is Lawvere's ETCS. I argue that CST has merit as a structuralist foundation, in that it ascribes only structural properties to typical mathematical objects. However, I also argue that this success depends on the adoption of a strict typing system (...) which undermines the metaphysical seriousness of this structuralism. Homotopy type theory adds to CST a distinctive theory of identity between sets, which arguably allows its objects to be seen as ante rem structures. I examine the prospects for such a view, and address many other interpretive problems as they arise. (shrink)

Corcoran’s 27 entries in the 1999 second edition of Robert Audi’s Cambridge Dictionary of Philosophy [Cambridge: Cambridge UP]. -/- ancestral, axiomatic method, borderline case, categoricity, Church (Alonzo), conditional, convention T, converse (outer and inner), corresponding conditional, degenerate case, domain, De Morgan, ellipsis, laws of thought, limiting case, logical form, logical subject, material adequacy, mathematical analysis, omega, proof by recursion, recursive function theory, scheme, scope, Tarski (Alfred), tautology, universe of discourse. -/- The entire work is available online free at more than (...) one website. Paste the whole URL. http://archive.org/stream/RobertiAudi_The.Cambridge.Dictionary.of.Philosophy/Robert.Audi_The.Cambrid ge.Dictionary.of.Philosophy -/- The 2015 third edition will be available soon. Before you think of buying it read some reviews on Amazon and read reviews of its competition: For example, my review of the 2008 Oxford Companion to Philosophy, History and Philosophy of Logic,29:3,291-292. URL: http://dx.doi.org/10.1080/01445340701300429 -/- Some of the entries have already been found to be flawed. For example, Tarski’s expression ‘materially adequate’ was misinterpreted in at least one article and it was misused in another where ‘materially correct’ should have been used. The discussion provides an opportunity to bring more flaws to light. -/- Acknowledgements: Each of these entries was presented at meetings of The Buffalo Logic Dictionary Project sponsored by The Buffalo Logic Colloquium. The members of the colloquium read drafts before the meetings and were generous with corrections, objections, and suggestions. Usually one 90-minute meeting was devoted to one entry although in some cases, for example, “axiomatic method”, took more than one meeting. Moreover, about half of the entries are rewrites of similarly named entries in the 1995 first edition. Besides the help received from people in Buffalo, help from elsewhere was received by email. We gratefully acknowledge the following: José Miguel Sagüillo, John Zeis, Stewart Shapiro, Davis Plache, Joseph Ernst, Richard Hull, Concha Martinez, Laura Arcila, James Gasser, Barry Smith, Randall Dipert, Stanley Ziewacz, Gerald Rising, Leonard Jacuzzo, George Boger, William Demopolous, David Hitchcock, John Dawson, Daniel Halpern, William Lawvere, John Kearns, Ky Herreid, Nicolas Goodman, William Parry, Charles Lambros, Harvey Friedman, George Weaver, Hughes Leblanc, James Munz, Herbert Bohnert, Robert Tragesser, David Levin, Sriram Nambiar, and others. -/- . (shrink)

This largely expository lecture deals with aspects of traditional solid geometry suitable for applications in logic courses. Polygons are plane or two-dimensional; the simplest are triangles. Polyhedra [or polyhedrons] are solid or three-dimensional; the simplest are tetrahedra [or triangular pyramids, made of four triangles]. -/- A regular polygon has equal sides and equal angles. A polyhedron having congruent faces and congruent [polyhedral] angles is not called regular, as some might expect; rather they are said to be subregular—a word coined for (...) this lecture. To repeat, a subregular polyhedron has congruent faces and congruent [polyhedral] angles. A subregular polyhedron whose faces are all regular polygons is regular—using standard terminology. -/- Geometers before Euclid showed that there are “essentially” only five regular polyhedra: every regular polyhedron is a tetrahedron (4 faces), a hexahedron or cube (6 faces), an octahedron (8 faces), a dodecahedron (12 faces), or an icosahedron (20 faces). -/- The first question is whether there are subregular polyhedra that are not regular. For example, are there tetrahedra having congruent angles and congruent triangular faces but whose faces are not equilateral triangles? -/- Another question is the classification of subregular polyhedra if they exist. For example, considering the fact that the regular tetrahedra all have equilateral triangles as faces, we ask which triangles other than equilaterals are faces of subregular tetrahedra. Similarly, considering the fact that the regular hexahedra all have squares as faces, we ask which quadrangles other than squares are faces of subregular hexahedra. -/- After introductory remarks that include historical and philosophical points, we concentrate on tetrahedra. A triangle that is congruent to each of the four faces of a tetrahedron is called a generator of the tetrahedron. The main result proved is that every acute triangle is a generator of a subregular tetrahedron. The proof includes an algorithm –implementable with scissors and paper –that constructs from any given acute triangle a subregular tetrahedron whose faces are congruent to the given triangle. -/- Algorithm: Given any acute triangle. Construct a similar triangle whose sides are double the sides of the given triangle. Draw the three lines connecting the three midpoints of the sides (making four triangles congruent to the given triangle—a central triangle surrounded by three peripheral triangles). Make three “hinges” along the lines connecting the midpoints. “Fold” the peripheral triangles together (into a tetrahedron). [LIGHTLY EDITED VERSION OF PRINTED ABSTRACT] Acknowledgements: William Lawvere, Colin McLarty, Irvin Miller, Frango Nabrasa, Lawrence Spector, Roberto Torretti, and Richard Vesley. -/- . (shrink)

Motivated by the urgency of making explicit "the laws of possible rational passage from one concept to another", which Professor F. William Lawvere brought into figural salience for all to see, here we begin to characterize the space of all mathematical concepts (whose kinship with ordinary concepts was highlighted by none other than Einstein) which determines all possible rational passages between concepts.

‎A universal schema for diagonalization was popularized by N. S‎. ‎Yanofsky (2003)‎, ‎based on a pioneering work of F.W‎. ‎Lawvere (1969)‎, ‎in which the existence of a (diagonolized-out and contradictory) object implies the existence of a fixed-point for a certain function‎. ‎It was shown that many self-referential paradoxes and diagonally proved theorems can fit in that schema‎. ‎Here‎, ‎we fit more theorems in the universal‎ ‎schema of diagonalization‎, ‎such as Euclid's proof for the infinitude of the primes and new (...) proofs of G. Boolos (1997) for Cantor's theorem on the non-equinumerosity of a set with its powerset‎. ‎Then‎, ‎in Linear Temporal Logic‎, ‎we show the non-existence of a fixed-point in this logic whose proof resembles the argument of Yablo's paradox (1985‎, ‎1993)‎. ‎Thus‎, ‎Yablo's paradox turns for the first time into a genuine mathematico-logical theorem in the framework of Linear Temporal Logic‎. ‎Again the diagonal schema of the paper is used in this proof; and it is also shown that G. Priest's inclosure schema (1997) can fit in our universal diagonal / fixed-point schema‎. ‎We also show the existence of dominating (Ackermann-like) functions (which dominate a given countable set of functions‎, ‎such as primitive recursive functions) in the schema. (shrink)

This sketch of a perhaps future 'Elementary Theory of the Category of Mereological Sums (including Mereological Wholes and Parts)' relates to my previous papers "The Topos of Emergence" and "Intelligible Gunk". I assert that for successfully categorizing Mereology one has to start with a specific setting of gunk. In this paper we will give a sketch of a categorically version of particular mereological structures. I.e. we will follow the example of F.W.Lawvere’s “An elementary theory of the category of sets” (...) -/- where he introduced a categorised version of set theory. We refer to sirenians mainly for the reason that they are the closest living relatives of elephants. -/- But they are also rather underestimated creatures - at the first moment rather dull and clumsy, but moving gracefully and elegant in their natural habitat.And some sailors already reckognized their bewitching attraction before we did.Yet we still think this sirenia is a modest creature compared with the elephant in the room. (shrink)

Beginning with an examination of the deep history of making things and thinking about making things made-up in our minds, I argue that the resultant declarative understanding of the procedural knowledge of abstracting theories and building models—the essence(s) of the practice of science—embodied in Conceptual Mathematics is worth learning beginning with high school, along with grammar and calculus. One of the many profound scientific insights introduced—in a manner accessible to total beginners—in Lawvere and Schanuel's Conceptual Mathematics textbook is: the (...) way we ought to think about things varies with the nature of things. In light of the universal yearning for understanding, it may be pedagogically unethical not to teach the eminently learnable Conceptual Mathematics. Summing it all, we need to champion the cause of taking Conceptual Mathematics to classrooms. (shrink)

That the state-of-affairs of cognitive science is not good is brought into figural salience in "What happened to cognitive science?" (Núñez et al., 2019). We extend their objective description of 'what's wrong' to a prescription of 'how to correct'. Cognitive science, in its quest to elucidate 'how we know', embraces a long list of subjects, while ignoring Mathematics (Fig. 1a, Núñez et al., 2019). Mathematics is known for making the unknown to be known (cf. solving for unknowns). This acknowledgement naturally (...) raises the question: does mathematical knowing inform knowing in general? Here we show that drawing parallels to mathematical knowing can facilitate the advancement of cognitive science (Lawvere, 1994). (shrink)

Cognition involves physical stimulation, neural coding, mental conception, and conscious perception. Beyond the neural coding of physical stimuli, it is not clear how exactly these component processes constitute cognition. Within mathematical sciences, category theory provides tools such as category, functor, and adjointness, which are indispensable in the explication of the mathematical calculations involved in acquiring mathematical knowledge. More speci cally, functorial semantics, in showing that theories and models can be construed as categories and functors, respectively, and in establishing the adjointness (...) between abstraction (of theories) and interpretation (to obtain models), mathematically accounts for knowing-within-mathematics. Here we show that mathematical knowing recapitulates--in an elementary form--ordinary cognition. The process of going from particulars (physical stimuli) to their concrete models (conscious percepts) via abstract theories (mental concepts) and measured properties (neural coding) is common to both mathematical knowing and ordinary cognition. Our investigation of the similarity between knowing-within-mathematics and knowing-in-general leads us to make a case for the development of the basic science of cognition in terms of the functorial semantics of mathematical knowing. (shrink)

Our manuscript addresses the foundational question of cognitive science: how do we know? Specifically, examination of the mathematics of acquiring mathematical knowledge revealed that knowing-within-mathematics is reflective of knowing-in-general. Based on the correspondence between ordinary cognition (involving physical stimuli, neural sensations, mental concepts, and conscious percepts) and mathematical knowing (involving objective particulars, measured properties, abstract theories, and concrete models), we put forward the functorial semantics of mathematical knowing as a formalization of cognition. Our investigation of the similarity between mathematics and (...) cognition led us to argue against the compartmentalization of scientific knowledge and ordinary cognition, and make a case for the understanding of the basic science of knowing in terms of functorial semantics. Recognizing functorial semantics as an elementary form of cognition can help advance cognitive science the way calculus helped in the advancement of physics. (shrink)