English
Related papers

Related papers: NNIL-formulas revisited: universal models and fini…

200 papers

Autoregressive models have become the de facto choice for sequence generation tasks, but standard approaches treat digits as independent tokens and apply cross-entropy loss, overlooking the coherent structure of numerical sequences. This…

Computation and Language · Computer Science 2025-05-29 Xiang Fei , Jinghui Lu , Qi Sun , Hao Feng , Yanjie Wang , Wei Shi , An-Lan Wang , Jingqun Tang , Can Huang

Finsler's lemma is a classic mathematical result with applications in control and optimization. When the lemma is applied to parameter-dependent LMIs, as such those that arise from problems of robust stability, the extra variables…

Optimization and Control · Mathematics 2017-11-15 João Y. Ishihara , Hugo T. M. Kussaba , Renato A. Borges

The normal form for an n-dimensional map with irreducible nilpotent linear part is determined using sl2-representation theory. We sketch by example how the reducible case can also be treated in an algorithmic manner. The construction (and…

Representation Theory · Mathematics 2020-03-04 Fahimeh Mokhtari , Ernst Roell , Jan Sanders

We study the modal completeness and the finite frame property of several sublogics of the logic $\mathbf{IL}$ of interpretability with respect to Visser frames, which are also called simplified Veltman frames. Among other things, we prove…

Logic · Mathematics 2024-05-22 Yuya Okawa , Taishi Kurahashi

Invertible neural networks (INNs) are neural network architectures with invertibility by design. Thanks to their invertibility and the tractability of Jacobian, INNs have various machine learning applications such as probabilistic modeling,…

Machine Learning · Computer Science 2022-04-18 Isao Ishikawa , Takeshi Teshima , Koichi Tojo , Kenta Oono , Masahiro Ikeda , Masashi Sugiyama

The distinctive architectural features of normalizing flows (NFs), notably bijectivity and tractable Jacobians, make them well-suited for generative modeling. Invertible neural networks (INNs) build on these principles to address supervised…

Machine Learning · Computer Science 2026-02-25 Shubhanshu Shekhar , Mohammad Javad Khojasteh , Ananya Acharya , Tony Tohme , Kamal Youcef-Toumi

Consistently fitting vanilla option surfaces is an important issue when it comes to modelling in finance. Local volatility models introduced by Dupire in 1994 are widely used to price and manage the risks of structured products. However,…

Analysis of PDEs · Mathematics 2009-11-20 Frederic Abergel , Remi Tachet

A number of first-order calculi employ an explicit model representation formalism for automated reasoning and for detecting satisfiability. Many of these formalisms can represent infinite Herbrand models. The first-order fragment of…

Logic in Computer Science · Computer Science 2019-05-10 Andreas Teucke , Marco Voigt , Christoph Weidenbach

We generalize the notion of symmetries of propositional formulas in conjunctive normal form to modal formulas. Our framework uses the coinductive models and, hence, the results apply to a wide class of modal logics including, for example,…

Logic in Computer Science · Computer Science 2013-04-01 Carlos Areces , Guillaume Hoffmann , Ezequiel Orbe

We describe an infinite-dimensional algebra of hidden symmetries of N=4 supersymmetric Yang-Mills (SYM) theory. Our derivation is based on a generalization of the supertwistor correspondence. Using the latter, we construct an infinite…

High Energy Physics - Theory · Physics 2008-11-26 Alexander D. Popov , Martin Wolf

We present a classically equivalent reformulation of the Standard Model. In this framework, the Higgs doublet is recast as a $2\times2$ matrix and right-handed fermion singlets are organized into novel doublets. This restructuring reveals a…

High Energy Physics - Theory · Physics 2025-12-08 Peng Huang

In this paper we define intensional models for the classical theory of types, thus arriving at an intensional type logic ITL. Intensional models generalize Henkin's general models and have a natural definition. As a class they do not…

Logic · Mathematics 2007-05-23 Reinhard Muskens

We introduce the notion of dependence, as a property of a Keisler measure, and generalize several results of [HPS13] on generically stable measures (in $NIP$ theories) to arbitrary theories. Among other things, we show that this notion is…

Logic · Mathematics 2025-06-09 Karim Khanaki

We define a Kripke semantics for a conditional logic based on the propositional logic $\mathsf{N4}$, the paraconsistent variant of Nelson's logic of strong negation; we axiomatize the minimal system induced by this semantics. The resulting…

Logic · Mathematics 2023-11-07 Grigory K. Olkhovikov

Dag Normann and the author have recently initiated the study of the logical and computational properties of the uncountability of $\mathbb{R}$ formalised as the statement $\textsf{NIN}$ (resp. $\textsf{NBI}$ that there is no injection…

Logic · Mathematics 2020-11-06 Sam Sanders

Non-exemplar class-incremental learning (NECIL) is to resist catastrophic forgetting without saving old class samples. Prior methodologies generally employ simple rules to generate features for replaying, suffering from large distribution…

Computer Vision and Pattern Recognition · Computer Science 2024-08-07 Jichuan Zhang , Yali Li , Xin Liu , Shengjin Wang

Let M to B, N to B be fibrations and f1,f2 :M to N be a pair of fibre-preserving maps. Using normal bordism techniques we define an invariant which is an obstruction to deforming the pair f1,f2 over B to a coincidence free pair of maps.In…

Algebraic Topology · Mathematics 2013-05-09 Daciberg L. Gonçalves , Ulrich Koschorke

In this paper, we build Fidel-structures valued models following the methodology developed for Heyting-valued models; recall that Fidel structures are not algebras in the universal algebra sense. Taking models that verify Leibniz law, we…

Logic · Mathematics 2022-10-18 Aldo Figallo-Orellano , Juan Sebastian Slagter

We expand the notion of characteristic formula to infinite finitely presentable subdirectly irreducible algebras. We prove that there is a continuum of varieties of Heyting algebras containing infinite finitely presentable subdirectly…

Logic in Computer Science · Computer Science 2012-08-14 Alex Citkin

In the present work we explore the potential of models of the discrete nonlinear Schr\"odinger (DNLS) type to support spatially localized and temporally quasiperiodic solutions on top of a finite background. Such solutions are rigorously…

Pattern Formation and Solitons · Physics 2023-06-16 E. G. Charalampidis , G. James , J. Cuevas-Maraver , D. Hennig , N. I. Karachalios , P. G. Kevrekidis