Related papers: Carnap's Early Metatheory: Scope and Limits
We introduce a cycle-expansion (fully deterministic) technique to compute the asymptotic behavior of arbitrary order transport moments. The theory is applied to different kinds of one-dimensional intermittent maps, and Lorentz gas with…
The principal methods for the definition of thermodynamic entropy are discussed with special reference to those developed by Carath\'eodory, the Keenan School, Lieb and Yngvason, and the present authors. An improvement of the latter method…
In 1933 Kolmogorov constructed a general theory that defines the modern concept of conditional expectation. In 1955 Renyi fomulated a new axiomatic theory for probability motivated by the need to include unbounded measures. We introduce a…
We generalise the correspondence between $\aleph 0$-categorical theories and their automorphism groups to arbitrary complete theories in classical logic, and to some theories (including, in particular, all $\aleph 0$-categorical ones) in…
Decision problems in physics have been an active field of research for quite a few decades resulting in some interesting findings in recent years. However, such research investigations are based on a priori knowledge of theoretical computer…
Humans can generate reasonable answers to novel queries (Schulz, 2012): if I asked you what kind of food you want to eat for lunch, you would respond with a food, not a time. The thought that one would respond "After 4pm" to "What would you…
In spite of its long history and classical character which goes back even to d'Alembert and Lagrange, the problems of constraints in mechanics of continua is still mysterious and full of misunderstandings. Let us mention the problem of…
From 1873 to 1897, Georg Cantor worked on developing set theory, and despite a strong initial resistance, it rapidly became accepted as the foundation of mathematics. In this work, however, we'll demonstrate that Cantor's use of infinity is…
Arising from the whole body of Wittgenstein's writings is a picture of a (not necessarily straight, linear, but admittedly tireless) journey to come to terms with the mechanics of language as an instrument to conceive `reality' and to…
This paper gives a counterexample to the impossibility, by G\"odel's second incompleteness theorem, of proving a formula expressing the consistency of arithmetic in a fragment of arithmetic on the assumption that the latter is consistent.…
The standard notion of formal theory, in Logic, is in general biased exclusively towards assertion: it commonly refers only to collections of assertions that any agent who accepts the generating axioms of the theory should also be committed…
Mathematicians invented Mathematics to escape from words, but at last they depend on them just as much as everybody else. At the end, all basic definitions will be reliant on words, yet the mathematician believes that he's elevated from…
Lists, multisets, and sets are well-known data structures whose usefulness is widely recognized in various areas of Computer Science. These data structures have been analyzed from an axiomatic point of view with a parametric approach in (*)…
`All models are wrong but some are useful' (George Box 1979). But, how to find those useful ones starting from an imperfect model? How to make informed data-driven decisions equipped with an imperfect model? These fundamental questions…
This article analyses some paragraphs of the Dissertatio de Arte Combinatoria (1666) where G.W. Leibniz considers the syntax of a language with a given number of primitive terms. We propose a new formulation which generalizes the…
This paper presents a unified framework for dealing with a deduction system and a denotational semantics of exceptions. It is based on the fact that handling exceptions can be seen as a kind of generalized case distinction. This point of…
Kaplan and Montague have showed that certain intuitive axioms for a first-order theory of knowledge, formalized as a predicate, are jointly inconsistent. Their arguments rely on self-referential formulas. I offer a consistent first-order…
We present several philosophical ideas emerging from the studies of complex systems. We make a brief introduction to the basic concepts of complex systems, for then defining "abstraction levels". These are useful for representing…
Reasoning about functions that operate over algebraic data types is an important problem for a large variety of applications. One application of particular interest is network applications that manipulate or reason about complex message…
Abstract algebraic logic is a theory that provides general tools for the algebraic study of arbitrary propositional logics. According to this theory, every logic L is associated with a matrix semantics Mod*(L). This paper is a contribution…