English
Related papers

Related papers: Extended Nonstandard Neutrosophic Logic, Set, and …

200 papers

We provide an existence and uniqueness theory for an extension of backward SDEs to the second order. While standard Backward SDEs are naturally connected to semilinear PDEs, our second order extension is connected to fully nonlinear PDEs,…

Probability · Mathematics 2013-06-18 H. Mete Soner , Nizar Touzi , Jianfeng Zhang

The use of Extended Logics to replace ordinary second order definability in Kleene's {\em Ramified Analytical Hierarchy} is investigated. This mirrors a similar investigation of Kennedy, Magidor and V\"a\"an\"anen \cite{KeMaVa2016} where…

Logic · Mathematics 2018-08-14 Philip Welch

Extended multi-adjoint logic programming arises as an extension of multi-adjoint normal logic programming where constraints and a special type of aggregator operator have been included. The use of this general aggregator operator permits to…

Logic in Computer Science · Computer Science 2024-10-08 M. Eugenia Cornejo , David Lobo , Jesús Medina

In this paper, we introduce Linear Logic with a nondeterministic facility, which has a self-dual additive connective. In the system the proof net technology is available in a natural way. The important point is that nondeterminism in the…

Logic in Computer Science · Computer Science 2009-09-29 Satoshi Matsuoka

We apply methods of nonstandard mathematics in order to regard analytic geometry in a very different way. For example, complex spaces are seen to be the "standard part" of certain algebraic nonstandard schemes. We construct a category of…

Algebraic Geometry · Mathematics 2008-06-27 Adel Khalfallah , Siegmund Kosarew

We develop some nonstandard techniques for bornological and coarse spaces. We first generalise the notion of bornology to prebornology, which better fits to coarse spaces. We then give nonstandard characterisations of some basic large-scale…

General Topology · Mathematics 2019-06-25 Takuma Imamura

(l) I have enough evidence to render the sentence S probable. (la) So, relative to what I know, it is rational of me to believe S. (2) Now that I have more evidence, S may no longer be probable. (2a) So now, relative to what I know, it is…

Artificial Intelligence · Computer Science 2016-11-26 Henry E. Kyburg

Let $\Lambda^{\ast}$ be the free monoid of (finite) words over a not necessarily finite alphabet $\Lambda$, which is equipped with some (partial) order. This ordering lifts to $\Lambda^{\ast}$, where it extends the divisibility ordering of…

Combinatorics · Mathematics 2018-05-08 Hans-Jürgen Bandelt , Maurice Pouzet

Monadic second order logic is the expansion of first order logic by quantifiers ranging over unary relations. We study the shared monadic second order theory of finite linear orders, i.e. the pseudofinite monadic second order theory of…

Logic · Mathematics 2021-05-27 Deacon Linkhorn

This book introduces the concept of neutrosophic bilinear algebras and their generalizations to n-linear algebras, n>2. This book has five chapters. The first chapter is introductory in nature and gives a few essential definitions and…

General Mathematics · Mathematics 2010-07-02 W. B. Vasantha Kandasamy , Florentin Smarandache

In this work we describe preferential Description Logics of typicality, a nonmonotonic extension of standard Description Logics by means of a typicality operator T allowing to extend a knowledge base with inclusions of the form T(C) v D,…

Artificial Intelligence · Computer Science 2020-04-24 Laura Giordano , Valentina Gliozzi , Antonio Lieto , Nicola Olivetti , Gian Luca Pozzato

This article introduces probabilistic disjunctive normal forms (PDNFs) as a framework for representing and reasoning about uncertainty in logical systems. Unlike classical DNFs, PDNFs assign real-valued weights to variables, encoding…

Logic in Computer Science · Computer Science 2026-03-13 Alexander Kuznetsov

Kohlenbach's proof mining program deals with the extraction of effective information from typically ineffective proofs. Proof mining has its roots in Kreisel's pioneering work on the so-called unwinding of proofs. The proof mining of…

Logic in Computer Science · Computer Science 2016-06-22 Sam Sanders

Recently, a novel fixed point operation has been introduced over certain non-monotonic functions between stratified complete lattices and used to give semantics to logic programs with negation and boolean context-free grammars. We prove…

Logic in Computer Science · Computer Science 2015-12-11 Zoltan Esik

The concept of a generalized nonanalytic expansion which involves nonanalytic combinations of exponentials, logarithms and powers of a coupling is introduced and its use illustrated in various areas of physics. Dispersion relations for the…

Mathematical Physics · Physics 2013-09-10 Ulrich D. Jentschura , Andrey Surzhykov , Jean Zinn-Justin

Nested Sampling is a method for computing the Bayesian evidence, also called the marginal likelihood, which is the integral of the likelihood with respect to the prior. More generally, it is a numerical probabilistic quadrature rule. The…

Computation · Statistics 2023-10-09 Jonas Latz , Doris Schneider , Philipp Wacker

The identification of causal effects in observational studies typically relies on two standard assumptions: unconfoundedness and overlap. However, both assumptions are often questionable in practice: unconfoundedness is inherently…

Methodology · Statistics 2025-09-17 Han Cui , Xinran Li

Indexed Linear Logic has been introduced by Ehrhard and Bucciarelli, it can be seen as a logical presentation of non-idempotent intersection types extended through the relational semantics to the full linear logic. We introduce an…

Logic in Computer Science · Computer Science 2024-02-16 Flavien Breuvart , Federico Olimpieri

We see how nested sequents, a natural generalisation of hypersequents, allow us to develop a systematic proof theory for modal logics. As opposed to other prominent formalisms, such as the display calculus and labelled sequents, nested…

Logic in Computer Science · Computer Science 2010-04-13 Kai Brünnler

Expansions of the monadic second-order (MSO) theory of the structure $\langle \mathbb{N} ; < \rangle$ have been a fertile and active area of research ever since the publication of the seminal papers of B\"uchi and Elgot & Rabin on the…

Logic in Computer Science · Computer Science 2025-07-23 Joris Nieuwveld , Joël Ouaknine