Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Other Mathematics (4)
- Algebra (3)
- Computer Engineering (3)
- Computer Sciences (3)
- Engineering (3)
-
- Other Computer Engineering (3)
- Other Computer Sciences (3)
- Applied Mathematics (2)
- Arts and Humanities (2)
- Logic and Foundations of Mathematics (2)
- Philosophy (2)
- Astrophysics and Astronomy (1)
- Discrete Mathematics and Combinatorics (1)
- Number Theory (1)
- Set Theory (1)
- Statistics and Probability (1)
- Institution
- Keyword
- Publication
- Publication Type
Articles 1 - 8 of 8
Full-Text Articles in Logic and Foundations
Does A Mathematical/Scientific Worldview Lead To A Clearer Or More Distorted View Of Reality?: Purposive Musings Inspired From Readings In The Urantia Book, The Cosmic Family, Volume I, And Elsewhere, Jeru
Humanistic Mathematics Network Journal
No abstract provided.
Notes On Formal Constructivism, D. Joyner, P. Lejarraga
Notes On Formal Constructivism, D. Joyner, P. Lejarraga
Humanistic Mathematics Network Journal
Our aim is to sketch some ideas related to how we (as in, we two) think we (as in, we humans) think. "That theory is useless. It isn't even wrong." - Wolfgang Pauli. Our hope in this paper is to provide a theory, admittedly somewhat vague, of how we think about mathematics. We also hope our ideas do not cause the reader to be reminded of Pauli's quote above. These notes were motivated by the interesting book by Changeaux and Connes.
Mathematisation Of The Science Of Motion And The Birth Of Analytical Mechanics : A Historiographical Note, Marco Panza
Mathematisation Of The Science Of Motion And The Birth Of Analytical Mechanics : A Historiographical Note, Marco Panza
MPP Published Research
Usually, one speaks of mathematization of a natural or social science to mean that mathematics comes to be a tool of such a science: the language of mathematics is used to formulate its results, and/or some mathematical techniques is employed to obtain these results.
Preface, Alexander Kurz
Preface, Alexander Kurz
Engineering Faculty Articles and Research
No abstract provided.
Definability, Canonical Models, And Compactness For Finitary Coalgebraic Modal Logic, Alexander Kurz, Dirk Pattinson
Definability, Canonical Models, And Compactness For Finitary Coalgebraic Modal Logic, Alexander Kurz, Dirk Pattinson
Engineering Faculty Articles and Research
This paper studies coalgebras from the perspective of the finitary observations that can be made of their behaviours. Based on the terminal sequence, notions of finitary behaviours and finitary predicates are introduced. A category Behω(T) of coalgebras with morphisms preserving finitary behaviours is defined. We then investigate definability and compactness for finitary coalgebraic modal logic, show that the final object in Behω(T) generalises the notion of a canonical model in modal logic, and study the topology induced on a coalgebra by the finitary part of the terminal sequence.
Proceedings Of The First International Conference On Neutrosophy, Neutrosophic Logic, Neutrosophic Set, Neutrosophic Probability And Statistics, Florentin Smarandache
Proceedings Of The First International Conference On Neutrosophy, Neutrosophic Logic, Neutrosophic Set, Neutrosophic Probability And Statistics, Florentin Smarandache
Branch Mathematics and Statistics Faculty and Staff Publications
In 1960s Abraham Robinson has developed the non-standard analysis, a formalization of analysis and a branch of mathematical logic, that rigorously defines the infinitesimals. Informally, an infinitesimal is an infinitely small number. Formally, x is said to be infinitesimal if and only if for all positive integers n one has xxx < 1/n. Let &>0 be a such infinitesimal number. The hyper-real number set is an extension of the real number set, which includes classes of infinite numbers and classes of infinitesimal numbers. Let’s consider the non-standard finite numbers 1+ = 1+&, where “1” is its standard part and “&” its non-standard part, …
Modal Predicates And Coequations, Alexander Kurz, Jiří Rosický
Modal Predicates And Coequations, Alexander Kurz, Jiří Rosický
Engineering Faculty Articles and Research
We show how coalgebras can be presented by operations and equations. This is a special case of Linton’s approach to algebras over a general base category X, namely where X is taken as the dual of sets. Since the resulting equations generalise coalgebraic coequations to situations without cofree coalgebras, we call them coequations. We prove a general co-Birkhoff theorem describing covarieties of coalgebras by means of coequations. We argue that the resulting coequational logic generalises modal logic.
On Minimal Regular Graphs With Given Constraintsm, Che Sheng Gan
On Minimal Regular Graphs With Given Constraintsm, Che Sheng Gan
Student Works (2000-2009)
A classical question in graph theory has been the search of cages. The problem of determining the smallest (r,g)-cage is unsolved for most pairs of (r,g) and is extremely hard in the general case. Finding the crossing number of a graph is another challenging problem in graph theory. The crossing numbers of very few classes of graphs arc known. In this thesis, we would like to (a) investigate those smallest regular graphs with given girths and having small crossing numbers. In particular, we investigate those smallest regular graphs with given girths and crossing number c, for c ∈ {0, 1, …