Related papers: An extensional Kleene realizability semantics for …
We propose a uniform way of defining for every logic ${\sf L}$ intermediate between intuitionistic and classical logics, the corresponding intermediate minimal tense logic ${\sf LK_t}$. This is done by building the fusion of two copies of…
Kleene's computability theory based on the S1-S9 computation schemes constitutes a model for computing with objects of any finite type and extends Turing's 'machine model' which formalises computing with real numbers. A fundamental…
A logic-enriched type theory (LTT) is a type theory extended with a primitive mechanism for forming and proving propositions. We construct two LTTs, named LTTO and LTTO*, which we claim correspond closely to the classical predicative…
This paper synthesizes a series of formal proofs to construct a unified theory on the logical limits of the Symbol Grounding Problem. We distinguish between internal meaning (sense), which formal systems can possess via axioms, and external…
I deal with two approaches to proof-theoretic semantics: one based on argument structures and justifications, which I call reducibility semantics, and one based on consequence among (sets of) formulas over atomic bases, called base…
The canonical seesaw models are one of the simplest and most natural scenarios that can account simultaneously for neutrino masses and matter-antimatter asymmetry in our universe. Below the seesaw scale, one can integrate out the heavy…
We present a logically principled foundation for systematizing, in a way that works with any computational effect and evaluation order, SMT constraint generation seen in refinement type systems for functional programming languages. By…
Automata operating on pairs of words were introduced as an alternative way of capturing acceptance of regular $\omega$-languages. Families of DFAs and lasso automata operating on such pairs followed, giving rise to minimisation algorithms,…
Any continuous piecewise-linear function $F\colon \mathbb{R}^{n}\to \mathbb{R}$ can be represented as a linear combination of $\max$ functions of at most $n+1$ affine-linear functions. In our previous paper [``Representing piecewise linear…
Cross-entropy (CE) training provides dense and scalable supervision for language models, but it optimizes next-token prediction under teacher forcing rather than sequence-level behavior under model rollouts. We introduce a feature-matching…
Precision observables are well known for constraining most of the Beyond Standard Model (BSM) scenarios tightly. We present here a simple and comprehensive fitting framework for various BSM scenarios to these observables. We start with the…
CZF is a system of set theory which, over classical logic, is equivalent to ZF, while over intuitionistic logic, it has a well-known constructive type-theoretic interpretation. This article introduces a simpler, intuitive family of…
In this paper, we define a new realizability semantics for the simply typed lambda-mu-calculus. We show that if a term is typable, then it inhabits the interpretation of its type. We also prove a completeness result of our realizability…
We propose RT (Refine Thought), a method that can enhance the semantic rea-soning ability of text embedding models. The method obtains the final semanticrepresentation by running multiple forward passes of the text embedding…
In terms of flavor invariants, we establish the intimate connection between leptonic CP violation in the canonical seesaw model for neutrino masses and that in the seesaw effective field theory (SEFT). For the first time, we calculate the…
Recent supervised fine-tuning (SFT) approaches have significantly improved language models' performance on mathematical reasoning tasks, even when models are trained at a small scale. However, the specific capabilities enhanced through such…
We revisit the question of whether the Crane-Yetter topological quantum field theory (TQFT) associated to a modular tensor category admits a fully extended refinement. More specifically, we use tools from stable homotopy theory to classify…
As shown in (http://dx.doi.org/10.1101/2020.03.22.998377), the usual update modes of Boolean networks (BNs), including synchronous and (generalized) asynchronous, fail to capture behaviors introduced by multivalued refinements. Thus, update…
Multiple-conclusion Hilbert-style systems allow us to finitely axiomatize every logic defined by a finite matrix. Having obtained such axiomatizations for Paraconsistent Weak Kleene and Bochvar-Kleene logics, we modify them by replacing the…
Large language models (LLMs) call for extension of context to handle many critical applications. However, the existing approaches are prone to expensive costs and inferior quality of context extension. In this work, we propose Extensible…