English
Related papers

Related papers: Non-deterministic inductive definitions

200 papers

Nonmonotonic logics are usually characterized by the presence of some notion of 'conditional' that fails monotonicity. Research on nonmonotonic logics is therefore largely concerned with the defeasibility of argument forms and the…

Logic in Computer Science · Computer Science 2013-10-29 Katarina Britz , Ivan Varzinczak

Based on empirical evidence from a free word order language (German) we propose a fundamental revision of the principles guiding the ordering of discourse entities in the forward-looking centers within the centering model. We claim that…

cmp-lg · Computer Science 2008-02-03 Michael Strube , Udo Hahn

In his unpublished preprint "Definable Valuations" Koenigsmann shows that every field that admits a t-henselian topology is either real closed or separably closed or admits a definable valuation inducing the t-henselian topology. To show…

Logic · Mathematics 2016-03-31 Katharina Dupont

Infinite determinantal measures introduced in this note are inductive limits of determinantal measures on an exhausting family of subsets of the phase space. Alternatively, an infinite determinantal measure can be described as a product of…

Probability · Mathematics 2014-07-28 Alexander I. Bufetov

We have recently showed that it is possible to deal with collections of indistinguishable elementary particles (in the context of quantum mechanics) in a set-theoretical framework by using hidden variables, in a sense. In the present paper…

Quantum Physics · Physics 2007-05-23 Adonai S. Sant'Anna

In this paper we provide an identity between determinant and generalized matrix function. Also, a criterion of positive semi-definite matrices affirming the permanent dominant conjecture is given. As a consequence, infinitely many infinite…

Rings and Algebras · Mathematics 2023-11-01 Kijti Rodtes

We first partly develop a mathematical notion of stable consistency intended to reflect the actual consistency property of human beings. Then we give a generalization of the first and second G\"odel incompleteness theorem to stably…

Logic in Computer Science · Computer Science 2022-08-16 Yasha Savelyev

We consider a philosophical question that is implicit in Selmer Bringsjord's paper, "The narrational case against Church's Thesis": If, as Mendelson argues, the classically accepted definitions of foundational concepts such as "partial…

General Mathematics · Mathematics 2007-05-23 Bhupinder Singh Anand

The standard treatment of sets and definable classes in first-order Zermelo-Fraenkel set theory accords in many respects with the Fregean foundational framework, such as the distinction between objects and concepts. Nevertheless, in set…

Logic · Mathematics 2022-09-19 Joel David Hamkins

We propose axioms governing the interaction of constructive assertibility and meaningfulness predicates with a self-applicative truth predicate characterized by the T-scheme, and we prove the consistency of the resulting formal system.

Logic · Mathematics 2025-10-10 Nik Weaver

We introduce the forcing model of IZFA (Intuitionistic Zermelo-Fraenkel set theory with Atoms) for every Grothendieck topology and prove that the topos of sheaves on every site is equivalent to the category of 'sets in this forcing model'.

Logic · Mathematics 2018-03-14 Keita Yamamoto

We give a precise definition of a formal mathematical object as any symbol for an individual constant, predicate letter, or a function letter that can be introduced through definition into a formal mathematical language without inviting…

General Mathematics · Mathematics 2007-05-23 Bhupinder Singh Anand

ZFC has sentences that quantify over all sets or all ordinals, without restriction. Some have argued that sentences of this kind lack a determinate meaning. We propose a set theory called TOPS, using Natural Deduction, that avoids this…

Logic · Mathematics 2019-06-14 Paul Blain Levy

Using the functional interpretation from proof theory, we analyze nonconstructive proofs of several central theorems about polynomial and differential polynomial rings. We extract effective bounds, some of which are new to the literature,…

Logic · Mathematics 2018-10-17 William Simmons , Henry Towsner

We present a family of paraconsistent counterparts of the constructive modal logic CK. These logics aim to formalise reasoning about contradictory but non-trivial propositional attitudes like beliefs or obligations. We define their…

Logic in Computer Science · Computer Science 2025-08-26 Han Gao , Daniil Kozhemiachenko , Nicola Olivetti

The main aim of this paper is to promote a certain style of doing coinductive proofs, similar to inductive proofs as commonly done by mathematicians. For this purpose, we provide a reasonably direct justification for coinductive proofs…

Logic in Computer Science · Computer Science 2019-05-24 Łukasz Czajka

In this article, recent results about point processes are used in sampling theory. Precisely, we define and study a new class of sampling designs: determinantal sampling designs. The law of such designs is known, and there exists a simple…

Methodology · Statistics 2025-08-27 Vincent Loonis , Xavier Mary

We provide a formal introduction into the classic theorems of general topology and its axiomatic foundations in set theory. In this second part we introduce the fundamental concepts of topological spaces, convergence, and continuity, as…

History and Overview · Mathematics 2013-07-01 Felix Nagel

Classification and invariants, with respect to basis changes, of finite dimensional algebras are considered. An invariant open, dense (in the Zariscki topology) subset of the space of structural constants is defined. The algebras with…

Rings and Algebras · Mathematics 2015-09-24 Ural Bekbaev

We derive a conditional variational principle of the saturated set for systems with the non-uniform structure. Our result applies to a broad class of systems including beta-shifts, S-gap shifts and their factors.

Dynamical Systems · Mathematics 2019-03-20 Cao Zhao , Ercai Chen