Related papers: On logical parameterizations and functional repres…
We study probabilistic team semantics which is a semantical framework allowing the study of logical and probabilistic dependencies simultaneously. We examine and classify the expressive power of logical formalisms arising by different…
This paper proposes a mixed-method socio-semantic network analysis of meaning structures in practice. While social and institutional fields impose meaning structures, to achieve practical goals field participants gather in groups and…
The effectful forcing technique allows one to show that the denotation of a closed System T term of type $(\iota \to \iota) \to \iota$ in the set-theoretical model is a continuous function $(\mathbb{N} \to \mathbb{N}) \to \mathbb{N}$. For…
The paper discuss the limit point concept of a subset in a group via ideal of the power set ring. This idea along with anti-ideal give the topological structure in a group. Homomorphic images of both ideal and anti-ideal are played the…
A characterization of t-normed integrals was obtained in \cite{CLM} for finite compacta and in \cite{Rad} for the general case. Such characterization establishes a correspondence between the space of capacities and homogeneous respect…
We prove some facts about locales $L$ equipped with the Scott topology $\Omega(L)$, in particular studying a canonical frame homomorphism $\phi:\Omega(L)\to L$ which is motivated by an application to cognitive science. Such a topological…
Extracting a subset of a given OWL ontology that captures all the ontology's knowledge about a specified set of terms is a well-understood task. This task can be based, for instance, on locality-based modules (LBMs). These come in two…
Epistemic logic programs constitute an extension of the stable models semantics to deal with new constructs called subjective literals. Informally speaking, a subjective literal allows checking whether some regular literal is true in all…
Many interesting and useful symbolic computation algorithms manipulate mathematical expressions in mathematically meaningful ways. Although these algorithms are commonplace in computer algebra systems, they can be surprisingly difficult to…
Satisfiability Modulo Theories (SMT) solvers incorporate decision procedures for theories of data types that commonly occur in software. This makes them important tools for automating verification problems. A limitation frequently…
AlphaGeometry represents a milestone in neuro-symbolic reasoning, yet its architecture faces a log-linear scaling bottleneck within its symbolic deduction engine that limits its efficiency as problem complexity increases. Recent technical…
Sets with atoms serve as an alternative to ZFC foundations for mathematics, where some infinite, though highly symmetric sets, behave in a finitistic way. Therefore, one can try to carry over analysis of the classical algorithms from finite…
Let G be the group of points of a quasi-split reductive algebraic group over a local field F. It follows from the local Langlands conjectures that to every non-trivial additive character of F and every representation of the Langlands dual…
A type theory is presented that combines (intuitionistic) linear types with type dependency, thus properly generalising both intuitionistic dependent type theory and full linear logic. A syntax and complete categorical semantics are…
The importance of intuitionistic temporal logics in Computer Science and Artificial Intelligence has become increasingly clear in the last few years. From the proof-theory point of view, intuitionistic temporal logics have made it possible…
This paper presents and extends our type theoretical framework for a compositional treatment of natural language semantics with some lexical features like coercions (e.g. of a town into a football club) and copredication (e.g. on a town as…
Topological data analysis (TDA) has been widely used to make progress on a number of problems. However, it seems that TDA application in natural language processing (NLP) is at its infancy. In this paper we try to bridge the gap by arguing…
We study the role of the second language in bilingual word embeddings in monolingual semantic evaluation tasks. We find strongly and weakly positive correlations between down-stream task performance and second language similarity to the…
This thesis develops the translation between category theory and computational linguistics as a foundation for natural language processing. The three chapters deal with syntax, semantics and pragmatics. First, string diagrams provide a…
Since the introduction by Hodges, and refinement by V\"a\"an\"anen, team semantic constructions have been used to generate expressively enriched logics still conserving nice properties, such as compactness or decidability. In contrast,…