Related papers: On logical parameterizations and functional repres…
Probabilistic team semantics is a framework for logical analysis of probabilistic dependencies. Our focus is on the axiomatizability, complexity, and expressivity of probabilistic inclusion logic and its extensions. We identify a natural…
A new model of symbol grounding is presented, in which the structures of natural language, logical semantics, perception and action are represented categorically, and symbol grounding is modeled via the composition of morphisms between the…
A unified theory of language combines a Bayesian cognitive linguistic model of language processing, with the proposal that language evolved by sexual selection for the display of intelligence. The theory accounts for the major facts of…
This essay contains three parts. The first part of essay focuses on the hypothesis of the functional semantic constructions (FSC-Hypothesis). This hypothesis explains that a language, a number, a money are the functional semantic…
In [2] Su Gao proves that the following are equivalent for a countable $M$ (cf. theorem 1.2 too): (I)There is an uncountable model of the Scott sentence of $M$. (II) There exists some $j\in \overline{Aut(M)}\setminus Aut(M)$, where…
Semantic parsing offers many opportunities to improve natural language understanding. We present a semantically annotated parallel corpus for English, German, Italian, and Dutch where sentences are aligned with scoped meaning…
We define and study logics in the framework of probabilistic team semantics and over metafinite structures. Our work is paralleled by the recent development of novel axiomatizable and tractable logics in team semantics that are closed under…
In a lexicalized grammar formalism such as Lexicalized Tree-Adjoining Grammar (LTAG), each lexical item is associated with at least one elementary structure (supertag) that localizes syntactic and semantic dependencies. Thus a parser for a…
The study of various decision problems for logic fragments has a long history in computer science. This paper is on the membership problem for a fragment of first-order logic over infinite words; the membership problem asks for a given…
We give a model-theoretic characterisation of the geometric theories classified by \'etendues -- the `locally localic' topoi. They are the theories where each model is determined, syntactically and semantically, by any witness of a fixed…
Feature Structures (FSs) are a widespread tool used for decompositional frameworks of Attribute-Value associations. Even though they thrive in simple systems, they lack a way of representing higher-order entities and relations. This is…
Given a multiplicatively closed subset $S$ of the integers, there exist Structure Theorems for $LC$ modules over the localization $\mathbb{Z}S^{-1}$ that are "similar" to those of $LCA$ groups. The most notable one is the 1st Theorem: Given…
Topological semantics for modal logics has recently gained new momentum in many different branches of logic. In this paper, we will consider the topological semantics of both classical and paraconsistent modal logics. This work is a new…
What makes two computational systems equivalent? Topos theory answers with classifying toposes: a system's semantic content is encoded in the geometric theory it classifies, and two presentations are equivalent when their classifying…
We adapt a construction of Gabrielov and Vorobjov for use in the symmetric case. Gabrielov and Vorobjov had developed a means by which one may replace an arbitrary set $S$ definable in some o-minimal expansion of $\mathbb{R}$ with a compact…
This note points out a lemma on closures of monotonic increasing functions and shows how it is applicable to decomposition and modularity for semantics defined as the least fixedpoint of some monotonic function. In particular it applies to…
This paper presents rules of inference for a binary quantifier $I$ for the formalisation of sentences containing definite descriptions within intuitionist positive free logic. $I$ binds one variable and forms a formula from two formulas.…
Let $s:[1,\infty) \to \C $ be a locally integrable function in Lebesgue's sense. The logarithmic (also called harmonic) mean of the function $s$ is defined by [\tau(t) := \frac 1{\log t} \int_1^t \frac {s(x)}{x} dx, \qquad t>1,] where the…
We define sound and adequate denotational and operational semantics for the stochastic lambda calculus. These two semantic approaches build on previous work that used similar techniques to reason about higher-order probabilistic programs,…
Let $G$ be a metric group and let $\sA ut(G)$ denote the automorphism group of $G$. If $\sA$ and $\sB$ are groups of $G$-valued maps defined on the sets $X$ and $Y$, respectively, we say that $\sA$ and $\sB$ are \emph{equivalent} if there…