English
Related papers

Related papers: A Semi-Constructive Approach to the Hyperreal Line

200 papers

Formal reasoning with non-denoting terms, esp. non-referring descriptions such as "the King of France", is still an under-investigated area. The recent exception being a series of papers e.g. by Indrzejczak, Zawidzki and K\"rbis. The…

Logic in Computer Science · Computer Science 2025-01-03 Jiří Raclavský

Argument mining automatically identifies and extracts the structure of inference and reasoning conveyed in natural language arguments. To the best of our knowledge, most of the state-of-the-art works in this field have focused on using…

Computation and Language · Computer Science 2023-02-28 Pranjal Srivastava , Pranav Bhatnagar , Anurag Goel

Before we apply nonlinear techniques, for example those inspired by chaos theory, to dynamical phenomena occurring in nature, it is necessary to first ask if the use of such advanced techniques is justified "by the data". While many…

chao-dyn · Physics 2009-10-31 Thomas Schreiber , Andreas Schmitz

By Lindstr\"{o}m's theorems, the expressive power of first order logic (and similarly continuous logic) is not strengthened without losing some interesting property. Weakening it, is however less harmless and has been payed attention by…

Logic · Mathematics 2024-08-23 Seyed-Mohammad Bagheri

Properties expressed as the provability of a first-order sentence can be disproved by just finding a model of the negation of the sentence. This fact, however, is meaningful in restricted cases only, depending on the shape of the sentence…

Programming Languages · Computer Science 2017-09-18 Salvador Lucas

We present a procedure which allows us to recover classical and nonclassical logical structures as \emph{concrete logics} associated with physical theories expressed by means of classical languages. This procedure consists in choosing, for…

Quantum Physics · Physics 2014-11-13 Claudio Garola , Sandro Sozzo

This paper belongs to a group of work in the intersection of symbolic computation and group analysis aiming for the symbolic analysis of differential equations. The goal is to extract important properties without finding the explicit…

Symbolic Computation · Computer Science 2024-01-31 Veronika Treumova , Dmitry A. Lyakhov , Dominik L. Michels

Default logic encounters some conceptual difficulties in representing common sense reasoning tasks. We argue that we should not try to formulate modular default rules that are presumed to work in all or most circumstances. We need to take…

Artificial Intelligence · Computer Science 2013-02-08 Choh Man Teng

This paper considers a formalisation of classical logic using general introduction rules and general elimination rules. It proposes a definition of `maximal formula', `segment' and `maximal segment' suitable to the system, and gives…

Logic in Computer Science · Computer Science 2023-04-25 Nils Kürbis

Stochastic processes offer a flexible mathematical formalism to model and reason about systems. Most analysis tools, however, start from the premises that models are fully specified, so that any parameters controlling the system's dynamics…

Systems and Control · Computer Science 2017-01-11 Luca Bortolussi , Guido Sanguinetti

{\AA}qvist's logics (E, F, F+(CM), and G) are among the best-known systems in the long tradition of preference-based approaches for modeling conditional obligation. While the general semantics of preference models align well with…

Logic in Computer Science · Computer Science 2024-10-16 Dmitry Rozplokhas

We consider the non-deterministic extension of the call-by-value lambda calculus, which corresponds to the additive fragment of the linear-algebraic lambda-calculus. We define a fine-grained type system, capturing the right linearity…

Logic in Computer Science · Computer Science 2012-09-12 Alejandro Díaz-Caro , Barbara Petit

This article introduces a novel nonparametric methodology for Generalized Linear Models which combines the strengths of the binary regression and latent variable formulations for categorical data, while overcoming their disadvantages.…

Machine Learning · Statistics 2021-10-12 K. P. Chowdhury

We present a novel reasoning calculus for the description logic SHOIQ^+---a knowledge representation formalism with applications in areas such as the Semantic Web. Unnecessary nondeterminism and the construction of large models are two…

Logic in Computer Science · Computer Science 2014-01-16 Boris Motik , Rob Shearer , Ian Horrocks

Traditional language models treat language as a finite state automaton on a probability space over words. This is a very strong assumption when modeling something inherently complex such as language. In this paper, we challenge this by…

Computation and Language · Computer Science 2016-04-04 Kushal Arora , Anand Rangarajan

A driving force behind the diverse applicability of modern machine learning is the ability to extract meaningful features across many sources. However, many practical domains involve data that are non-identically distributed across sources,…

Machine Learning · Statistics 2024-10-16 Thomas T. Zhang , Bruce D. Lee , Ingvar Ziemann , George J. Pappas , Nikolai Matni

In two recent papers we introduced some new techniques for constructing an extension of a probability-preserving system $T:\mathbb{Z}^d\curvearrowright (X,\mu)$ that enjoys certain desirable properties in connexion with the asymptotic…

Dynamical Systems · Mathematics 2014-09-09 Tim Austin

In this paper we study an overdetermined problem which is directly related to the well known torsion problem studied by J. Serrin. A perturbed version of the latter is tackled by using asymptotic series as well as tools borrowed from the…

Analysis of PDEs · Mathematics 2026-03-23 Alessandro Fortunati , Filomena Pacella

This is an overview of a few possibilities that are open by model theory in applied mathematics. Most attention is paid to the present state and frontiers of the Cauchy method of majorants, approximation of operator equations with…

Optimization and Control · Mathematics 2011-05-31 S. S. Kutateladze

We investigate non-wellfounded proof systems based on parsimonious logic, a weaker variant of linear logic where the exponential modality ! is interpreted as a constructor for streams over finite data. Logical consistency is maintained at a…

Logic in Computer Science · Computer Science 2025-09-03 Matteo Acclavio , Gianluca Curzi , Giulio Guerrieri