The ‘syntax’ and ‘combinatorics’ of my title are what Curry (1961) referred to as phenogrammatics and tectogrammatics respectively. Tectogrammatics is concerned with the abstract combinatorial structure of the grammar and directly informs semantics, while phenogrammatics deals with concrete operations on syntactic data structures such as trees or strings. In a series of previous papers (Muskens, 2001a; Muskens, 2001b; Muskens, 2003) I have argued for an architecture of the grammar in which finite sequences of lambda terms are the basic data (...) structures, pairs of terms syntax, semantics for example. These sequences then combine with the help of simple generalizations of the usual abstraction and application operations. This theory, which I call Lambda Grammars and which is closely related to the independently formulated theory of Abstract Categorial Grammars (de Groote, 2001; de Groote, 2002), in fact is an implementation of Curry’s ideas: the level of tectogrammar is encoded by the sequences of lambda-terms and their ways of combination, while the syntactic terms in those sequences constitute the phenogrammatical level. In de Groote’s formulation of the theory, tectogrammar is the level of abstract terms, while phenogrammar is the level of object terms. (shrink)

Karl Christian Friedrich Krause and Georg Wilhelm Friedrich Hegel are two representatives of German Idealism, both of whom developed impressing category systems. At the core of both systems is the question of the relation of the Absolute to its determinations and the determinations of finite beings. Both idealists try to deduce their respective category systems from the immediacy of the Absolute. Both use combinatorial methods to get from known to new categories or constellations in the system, which then unfold in (...) the world. Krause is thereby considered the eponym of so-called panentheism, the doctrine that “Everything is in God.” Hegel is also often referred to as a panentheist. Through a comparison of the two systems of categories, in this essay the thesis will be advocated that Hegel was in no sense a panentheist. Krause is and remains the gold standard of panentheism. (shrink)

General Morphological Analysis (GMA) is a computer-aided, non-quantified modelling method employing (discrete) category variables for identifying and investigating the total set of possible relationships contained in a given problem complex. The epistemological principle underlying discrete variable morphological modelling is that of decomposing a complex (multivariate) concept into a number of(“simple”) one dimensional concepts (i.e. category variables), the domains of which can then be recombined and recomposed in order to discover all of the other possible (multidimensional) concepts which can be generated (...) combinatorically. (shrink)

The distinction between the discrete and the continuous lies at the heart of mathematics. Discrete mathematics (arithmetic, algebra, combinatorics, graph theory, cryptography, logic) has a set of concepts, techniques, and application areas largely distinct from continuous mathematics (traditional geometry, calculus, most of functional analysis, differential equations, topology). The interaction between the two – for example in computer models of continuous systems such as fluid flow – is a central issue in the applicable mathematics of the last hundred years. This (...) article explains the distinction and why it has proved to be one of the great organizing themes of mathematics. (shrink)

Why should moral philosophers, moral psychologists, and machine ethicists care about computational complexity? Debates on whether artificial intelligence (AI) can or should be used to solve problems in ethical domains have mainly been driven by what AI can or cannot do in terms of human capacities. In this paper, we tackle the problem from the other end by exploring what kind of moral machines are possible based on what computational systems can or cannot do. To do so, we analyze normative (...) ethics through the lens of computational complexity. First, we introduce computational complexity for the uninitiated reader and discuss how the complexity of ethical problems can be framed within Marr’s three levels of analysis. We then study a range of ethical problems based on consequentialism, deontology, and virtue ethics, with the aim of elucidating the complexity associated with the problems themselves (e.g., due to combinatorics, uncertainty, strategic dynamics), the computational methods employed (e.g., probability, logic, learning), and the available resources (e.g., time, knowledge, learning). The results indicate that most problems the normative frameworks pose lead to tractability issues in every category analyzed. Our investigation also provides several insights about the computational nature of normative ethics, including the differences between rule- and outcome-based moral strategies, and the implementation-variance with regard to moral resources. We then discuss the consequences complexity results have for the prospect of moral machines in virtue of the trade-off between optimality and efficiency. Finally, we elucidate how computational complexity can be used to inform both philosophical and cognitive-psychological research on human morality by advancing the moral tractability thesis. (shrink)

If the semantic value of predicates are, as Williamson assumes, properties, then epistemicism is immediate. Epistemicism fails, so also this properties view of predicates. I use examination of Williamsons position as a foil, showing that his two positive arguments for bivalence fail, and that his efforts to rescue epistemicism from obvious problems fail to the point of incoherence. In Part II I argue that, despite the properties view’s problems, it has an important role to play in combinatorial semantics. We may (...) separate the problem of how smallest parts of language get attached to the world from the problem of how those parts combine to form complex semantic values. For the latter problem we idealize and treat the smallest semantic values as properties (and referents). So doing functions to put to one side how the smallest parts get worldly attachment, a problem that would just get in the way of understanding the combinatorics. Attachment to the world has to be studied separately, and I review some of the options. As a bonus we see why, mostly, higher order vagueness is an artifact of taking properties as semantic values literally instead of as a simplifying idealization. (shrink)

D O N A L D D AV I D S O N’S “ Meaning and Truth,” re vo l u t i o n i zed our conception of how truth and meaning are related (Davidson    ). In that famous art i c l e , Davidson put forw a rd the bold conjecture that meanings are satisfaction conditions, and that a Tarskian theory of truth for a language is a theory of meaning for that language. (...) In “Meaning and Truth,” Davidson proposed only that a Tarskian truth theory is a theory of meaning. But in “Theories of Me a n i n g and Learnable Languages,” he argued that the finite base of a Tarskian theory, together with the now familiar combinatorics, would explain how a language with unbounded expre s s i ve capacity could be learned with finite means ( Davidson    ). This certainly seems to imply that learning a language is, in p a rt at least, learning a Tarskian truth theory for it, or, at least, learning what is specified by such a theory. Davisdon was cagey about committing to the view that meanings actually a re satisfaction conditions, but subsequent followers had no such scru p l e s . We can sum this up in a trio of claims: Davidson’s Conjecture () A theory of meaning for L is a truth-conditional semantics for L. () To know the meaning of an expression in L is to know a satisfaction condition for that expression. () Meanings are satisfaction conditions. For the most part, it will not matter in what follows which of these claims is at stake. I will simply take the three to be different ways of formulating what I will call Davidson’s Conjecture (or sometimes just The Conjecture). Davidson’s Conjecture was a very bold conjecture. I think we are now in a.. (shrink)

I present a solution to the epistemological or characterisation problem of induction. In part I, Bayesian Confirmation Theory (BCT) is discussed as a good contender for such a solution but with a fundamental explanatory gap (along with other well discussed problems); useful assigned probabilities like priors require substantive degrees of belief about the world. I assert that one does not have such substantive information about the world. Consequently, an explanation is needed for how one can be licensed to act as (...) if one has substantive information about the world when one does not. I sketch the outlines of a solution in part I, showing how it differs from others, with full details to follow in subsequent parts. The solution is pragmatic in sentiment (though differs in specifics to arguments from, for example, William James); the conceptions we use to guide our actions are and should be at least partly determined by preferences. This is cashed out in a reformulation of decision theory motivated by a non-reductive formulation of hypotheses and logic. A distinction emerges between initial assumptions--that can be non-dogmatic--and effective assumptions that can simultaneously be substantive. An explanation is provided for the plausibility arguments used to explain assigned probabilities in BCT. -/- In subsequent parts, logic is constructed from principles independent of language and mind. In particular, propositions are defined to not have form. Probabilities are logical and uniquely determined by assumptions. The problems considered fatal to logical probabilities--Goodman's `grue' problem and the uniqueness of priors problem are dissolved due to the particular formulation of logic used. Other problems such as the zero-prior problem are also solved. -/- A universal theory of (non-linguistic) meaning is developed. Problems with counterfactual conditionals are solved by developing concepts of abstractions and corresponding pictures that make up hypotheses. Spaces of hypotheses and the version of Bayes' theorem that utilises them emerge from first principles. -/- Theoretical virtues for hypotheses emerge from the theory. Explanatory force is explicated. The significance of effective assumptions is partly determined by combinatoric factors relating to the structure of hypotheses. I conjecture that this is the origin of simplicity. (shrink)

Since the pioneering work of Birkhoff and von Neumann, quantum logic has been interpreted as the logic of (closed) subspaces of a Hilbert space. There is a progression from the usual Boolean logic of subsets to the "quantum logic" of subspaces of a general vector space--which is then specialized to the closed subspaces of a Hilbert space. But there is a "dual" progression. The notion of a partition (or quotient set or equivalence relation) is dual (in a category-theoretic sense) to (...) the notion of a subset. Hence the Boolean logic of subsets has a dual logic of partitions. Then the dual progression is from that logic of partitions to the quantum logic of direct-sum decompositions (i.e., the vector space version of a set partition) of a general vector space--which can then be specialized to the direct-sum decompositions of a Hilbert space. This allows the logic to express measurement by any self-adjoint operators rather than just the projection operators associated with subspaces. In this introductory paper, the focus is on the quantum logic of direct-sum decompositions of a finite-dimensional vector space (including such a Hilbert space). The primary special case examined is finite vector spaces over ℤ₂ where the pedagogical model of quantum mechanics over sets (QM/Sets) is formulated. In the Appendix, the combinatorics of direct-sum decompositions of finite vector spaces over GF(q) is analyzed with computations for the case of QM/Sets where q=2. (shrink)

According to John D. Norton's Material Theory of Induction, all inductive inferences are justified by local facts, rather than their formal features or some grand principles of nature's uniformity. Recently, Richard Dawid (Found Phys 45(9):1101–1109, 2015) has offered a challenge to this theory: in an adaptation of Norton's own celebrated "Dome" thought experiment, it seems that there are certain inductions that are intuitively reasonable, but which do not have any local facts that could serve to justify them in accordance with (...) Norton's requirements. Dawid's suggestion is that “raw induction” might have a limited but important role for such inferences. I argue that the Material Theory can accommodate such inductions, because there are local facts concerning the combinatoric features of the induction’s target populations that can licence the inferences in an analogous way to existing examples of material induction. Since my arguments are largely independent of the details of the Dome, Norton's theory emerges as surprisingly robust against criticisms of excessive narrowness. (shrink)

The ancient doctrine of the eternal return of the same embodies a thoroughgoing rejection of the hope that the future world will be better than the present. For this reason, it might seem surprising that Leibniz constructs an argument for a version of the doctrine. He concludes in one text that in the far distant future he himself ‘would be living in a city called Hannover located on the Leine river, occupied with the history of Brunswick, and writing letters to (...) the same friends with the same meaning.’ However, his argument concludes not that the future will be absolutely identical to the present, but rather that any finite description of the present and future worlds would be identical. In this way, the argument leaves room for the promise of a different and better future—even if it is one that could not be recognized by us as such. (shrink)

The overall goal of the approach developed in this paper is to estimate the likelihood of a given kinetic kill scenario between hostile spacebased adversaries using the mathematical framework of Complex Conceptual Spaces Single Observation. Conceptual spaces are a cognitive model that provide a method for systematically and automatically mimicking human decision making. For accurate decisions to be made, the fusion of both hard and soft data into a single decision framework is required. This presents several challenges to this data (...) fusion framework. The first is the challenge involved in handling multiple complex terminologies, which is addressed by drawing on a set of Space Domain Ontologies. Another challenge is the complex combinatorics involved when considering all possible feature combinations. This can be mitigated by using integer linear programming optimization that is outlined by the Complex Conceptual Spaces Single Observation mathematical model framework. A third challenge is the complicated physics that is involved in a spacecraft collision that must be addressed to obtain a better understanding of threat assessment. Overcoming these various challenges allows for a quantitative ranking for the potential of a kinetic kill collision across multiple spacecraft pairs. In addition to overcoming these challenges this paper will break down threat assessment into four domains and identify a ranking of threat both for each individual domain and for the four domains combined. Simulation results are shown to verify the developed concepts. (shrink)

Over the past two decades, gamblers have begun taking mathematics into account more seriously than ever before. While probability theory is the only rigorous theory modeling the uncertainty, even though in idealized conditions, numerical probabilities are viewed not only as mere mathematical information, but also as a decision-making criterion, especially in gambling. This book presents the mathematics underlying the major games of chance and provides a precise account of the odds associated with all gaming events. It begins by explaining in (...) simple terms the meaning of the concept of probability for the layman and goes on to become an enlightening journey through the mathematics of chance, randomness and risk. It then continues with the basics of discrete probability, combinatorics and counting arguments for those interested in the supporting mathematics. These mathematic sections may be skipped by readers who do not have a minimal background in mathematics; these readers can skip directly to the Guide to Numerical Results to pick the odds and recommendations they need for the desired gaming situation. Doing so is possible due to the organization of that chapter, in which the results are listed at the end of each section, mostly in the form of tables. The chapter titled The Mathematics of Games of Chance presents these games not only as a good application field for probability theory, but also in terms of human actions where probability-based strategies can be tried to achieve favorable results. Through suggestive examples, the reader can see what are the experiments, events and probability fields in games of chance and how probability calculus works there. The main portion of this work is a collection of probability results for each type of game. Each game s section is packed with formulas and tables. Each section also contains a description of the game, a classification of the gaming events and the applicable probability calculations. The primary goal of this work is to allow the reader to quickly find the odds for a specific gaming situation, in order to improve his or her betting/gaming decisions. Every type of gaming event is tabulated in a logical, consistent and comprehensive manner. The complete methodology and complete or partial calculations are shown to teach players how to calculate probability for any situation, for every stage of the game for any game. Here, readers can find the real odds, returned by precise mathematical formulas and not by partial simulations that most software uses. Collections of odds are presented, as well as strategic recommendations based on those odds, where necessary, for each type of gaming situation. The book contains much new and original material that has not been published previously and provides great coverage of probabilities for the following games of chance: Dice, Slots, Roulette, Baccarat, Blackjack, Texas Hold em Poker, Lottery and Sport Bets. Most of games of chance are predisposed to probability-based decisions. This is why the approach is not an exclusively statistical one, but analytical: every gaming event is taken as an individual applied probability problem to solve. A special chapter defines the probability-based strategy and mathematically shows why such strategy is theoretically optimal.". (shrink)

This work is a complete mathematical guide to lottery games, covering all of the problems related to probability, combinatorics, and all parameters describing the lottery matrices, as well as the various playing systems. The mathematics sections describe the mathematical model of the lottery, which is in fact the essence of the lotto game. The applications of this model provide players with all the mathematical data regarding the parameters attached to the gaming events and personal playing systems. By applying these (...) data, one can find all the winning probabilities for the play with one line, and how these probabilities change with playing the various types of systems containing several lines, depending on their structure. Also, each playing system has a formula attached that provides the number of possible multiple prizes in various circumstances. Other mathematical parameters of the playing systems and the correlations between them are also presented. The generality of the mathematical model and of the obtained formulas allows their application for any existent lottery and any playing system. Each formula is followed by numerical results covering the most frequent lottery matrices worldwide and by multiple examples predominantly belonging to the 6/49 lottery. The listing of the numerical results in dozens of well-organized tables, along with instructions and examples of using them, makes possible the direct usage of this guide by players without a mathematical background. The author also discusses from a mathematical point of view the strategies of choosing involved in the lotto game. The book does not offer so-called winning strategies, but helps players to better organize their own playing systems and to confront their own convictions with the incontestable reality offered by the direct applications of the mathematical model of the lotto game. As a must-have handbook for any lottery player, this book offers essential information about the game itself and can provide the basis for gaming decisions of any kind. (shrink)

General Morphological Analysis (GMA) is a method for structuring a conceptual problem space – called a morphospace – and, through a process of existential combinatorics, synthesizing a solution space. As such, it is a basic modelling method, on a par with other scientific modelling methods including System Dynamics Modelling, Bayesian Networks and various types graph-based “influence diagrams”. The purpose of this article is 1) to present the theoretical and methodological basics of morphological modelling; 2) to situate GMA within a (...) broader modelling theoretical framework by developing a (morphological) model representing different modelling methods, and 3) to demonstrate some of the basic modelling techniques that can be carried out with GMA using dedicated computer support. (shrink)

Analytical philosophy is ruled by the alliance of logic, linguistics and mathematics since its beginnings in the syllogistic calculus of terms and premises in Aristotle's Analytica protera, in the theories of medieval logic that dealt with what are Proprietatis Terminorum (significatio, suppositio, appellatio), in the theological apologetics of argumentation with the combinatorics of symbols by Raymundus Llullus in the work Ars Magna, Generalis et Ultima (1305-08), in what is presented as Theologia Combinata (cf. Tomus II.p.251) in Ars Magna Sciendi (...) sive Combinatoria by Athanasius Kircher (1669), in analytical combinatorics based in Leibniz's dissertation Ars Combinatoria (1666), where language is understood as a lingua characteristica and as a calculus ratiocinator, in the combinatorics of classes that have the meanings 1 or 0 given in the idea of Boolean functions (1854), in Frege's work Begriffschrift, eine der arithmeticeschen nachgebildete Fomelsprache des reinen Denkens (Concept letter, the language of formulas of pure thought made according to the model in arithmetical language), in Cantor's study of set theory / Grundlagen einer allgemeinen Mannigfaltigkeitstheorie (1883) and up to algorithms of fuzzy logic as a "means of approximate thinking that is in the human prior" (Zadeh, 1990) and fuzzy linguistics in computer semantics (Burghard B. Rieger, 1993). These are all the philosophical ideas of mathematicians and logicians that founded what we call logical pragmatism here as a demand that logic be absolutely used in every way in which it will dominate the grammar of language until logic itself becomes the philosophical grammar of the mind!!! (shrink)

(1) An introduction to the principles of conceptual modelling, combinatorial heuristics and epistemological history; (2) the examination of a number of perennial epistemological-methodological schemata: conceptual spaces and blending theory; ars inveniendi and ars demonstrandi; the two modes of analysis and synthesis and their relationship to ars inveniendi; taxonomies and typologies as two fundamental epistemic structures; extended cognition, cognitio symbolica and model-based reasoning; (3) Plato’s notions of conceptual spaces, conceptual blending and hypothetical-analogical models (paradeigmata); (4) Ramon Llull’s concept analysis and combinatoric (...) spaces; (5) Gottfried Leibniz’s development of compositional analysis and synthesis as a general modelling method and a paradigm for ars inveniendi; (6) Fritz Zwicky’s revival of the morphological method of analysis and construction, and its subsequent computerised applications. (shrink)

The present volume is an introduction to the use of tools from computability theory and reverse mathematics to study combinatorial principles, in particular Ramsey's theorem and special cases such as Ramsey's theorem for pairs. It would serve as an excellent textbook for graduate students who have completed a course on computability theory.

Proof-theoretic models of grammar are based on the view that an explicit characterization of a language comes in the form of the recursive enumeration of strings in that language. That recur-sive enumeration is carried out by a procedure which strongly generates a set of structural de-scriptions Σ and weakly generates a set of strings S; a grammar is thus a function that pairs an element of Σ with elements of S. Structural descriptions are obtained by means of Context-Free phrase structure (...) rules or via recursive combinatorics and structure is assumed to be uniform: binary branching trees all the way down. In this work we will analyse natural language constructions for which such a rigid conception of phrase structure is descriptively inadequate, and pro-pose a solution for the problem of phrase structure grammars assigning too much or too little structure to natural language strings: we propose that the grammar can oscillate between levels of computational complexity in local domains, which correspond to elementary trees in a lexicalised Tree Adjoining Grammar. (shrink)

A biologically unavoidable sequence is an infinite gender sequence which occurs in every gendered, infinite genealogical network satisfying certain tame conditions. We show that every eventually periodic sequence is biologically unavoidable (this generalizes König's Lemma), and we exhibit some biologically avoidable sequences. Finally we give an application of unavoidable sequences to cellular automata.

The Internet-of-Things (IoT) is gradually being established as the new computing paradigm, which is bound to change the ways of our everyday working and living. IoT emphasizes the interconnection of virtually all types of physical objects (e.g., cell phones, wearables, smart meters, sensors, coffee machines and more) towards enabling them to exchange data and services among themselves, while also interacting with humans as well. Few years following the introduction of the IoT concept, significant hype was generated as a result of (...) the proliferating number of IoT-enabled devices, which (according to many projections) are expected to amount to several billion in the next years. During recent years, this hype has been turning to reality, as a wave of IoT applications with significant social and economic has been emerging. Data analytics is the process of deriving knowledge from data, generating value like actionable insights from them. This article reviews work in the IoT and big data analytics from the perspective of their utility in creating efficient, effective and innovative applications and services for a wide spectrum of domains. We review the broad vision for the IoT as it is shaped in various communities, examine the application of data analytics across IoT domains, provide a categorization of analytic approaches and propose a layered taxonomy from IoT data to analytics. IoT data analysis is an integral element of any non- trivial IoT system. Nevertheless, IoT analytics are still in their infancy, as IoT data still remain largely unexploited. (shrink)