English
Related papers

Related papers: The language of Stratified Sets is confluent and s…

200 papers

Stratified formulae were introduced by Quine as an alternative way to attack Russell's Paradox. Instead of limiting comprehension by size (as in $\mathsf{ZF}$ set theory, using its axiom scheme of separation), unlimited comprehension is…

Logic · Mathematics 2025-09-23 Calliope Ryan-Smith

The Stratified Foundations are a restriction of naive set theory where the comprehension scheme is restricted to stratifiable propositions. It is known that this theory is consistent and that proofs strongly normalize in this theory.…

Logic in Computer Science · Computer Science 2023-05-31 Gilles Dowek

Using techniques developed in the revision theory of truth, I build a model for the set theory NF (New Foundations) developed by Quine in ZF, therefore proving its consistency relative to ZF. The model is essentially a term model; the sets…

Logic · Mathematics 2007-05-23 Mika Oksanen

In this paper, we propose a first-order ontology for generalized stratified order structure. We then classify the models of the theory using model-theoretic techniques. An ontology mapping from this ontology to the core theory of Process…

Artificial Intelligence · Computer Science 2009-07-17 Dai Tri Man Le

Various feature descriptions are being employed in logic programming languages and constrained-based grammar formalisms. The common notational primitive of these descriptions are functional attributes called features. The descriptions…

cmp-lg · Computer Science 2008-02-03 Rolf Backofen , Gert Smolka

We present the formalization of a theory of syntax with bindings that has been developed and refined over the last decade to support several large formalization efforts. Terms are defined for an arbitrary number of constructors of varying…

Logic in Computer Science · Computer Science 2017-07-04 Lorenzo Gheri , Andrei Popescu

The regular languages with a neutral letter expressible in first-order logic with one alternation are characterized. Specifically, it is shown that if an arbitrary $\Sigma_2$ formula defines a regular language with a neutral letter, then…

Logic in Computer Science · Computer Science 2022-03-14 Corentin Barloy , Michaël Cadilhac , Charles Paperman , Thomas Zeume

In this paper we develop a formal system called Natural Term Logic (NTL). NTL aims to represent key aspects of the logical and grammatical mechanisms of natural language as well as grammatical transformations which preserve core logical…

Logic · Mathematics 2026-05-26 Clarence Protin

Categorical compositional distributional semantics is a model of natural language; it combines the statistical vector space models of words with the compositional models of grammar. We formalise in this model the generalised quantifier…

Computation and Language · Computer Science 2019-11-12 Jules Hedges , Mehrnoosh Sadrzadeh

This article examines the notion of invariance under different kinds of permutations in a milieu of a theory of classes and sets, as a semantic motivation for Quine's new foundations "NF". The approach largely depends on interpreting a…

Logic · Mathematics 2020-12-16 Zuhair Al-Johar

We firstly show that the standard interpretation of natural quantification in mathematical logic does not provide a satisfying account of its original richness. In particular, it ignores the difference between generic and distributive…

Logic · Mathematics 2011-07-12 Michele Abrusci , Christian Retoré

The idea of this approach towards proving the consistency of Quine's New Foundations set theory is to go in a completely untyped manner. So no contemplation about types is utilized here. All conceptualization pivots around proving a handful…

Logic · Mathematics 2021-07-27 Zuhair Al-Johar

Sets with atoms serve as an alternative to ZFC foundations for mathematics, where some infinite, though highly symmetric sets, behave in a finitistic way. Therefore, one can try to carry over analysis of the classical algorithms from finite…

Logic in Computer Science · Computer Science 2021-01-26 Michał R. Przybyłek

We introduce and investigate the concept of Stratified Algebra, a new algebraic framework equipped with a layer-based structure on a vector space. We formalize a set of axioms governing intra-layer and inter-layer interactions, study their…

General Mathematics · Mathematics 2025-05-27 Stanislav Semenov

Generalizations of linear numeration systems in which the set of natural numbers is recognizable by finite automata are obtained by describing an arbitrary infinite regular language following the lexicographic ordering. For these systems of…

Other Computer Science · Computer Science 2007-05-23 Pierre B. A. Lecomte , Michel Rigo

We propose a generalization of first-order logic originating in a neglected work by C.C. Chang: a natural and generic correspondence language for any types of structures which can be recast as Set-coalgebras. We discuss axiomatization and…

Logic in Computer Science · Computer Science 2023-06-22 Tadeusz Litak , Dirk Pattinson , Katsuhiko Sano , Lutz Schröder

We study tree languages that can be defined in \Delta_2 . These are tree languages definable by a first-order formula whose quantifier prefix is forall exists, and simultaneously by a first-order formula whose quantifier prefix is . For the…

Formal Languages and Automata Theory · Computer Science 2019-03-14 Mikolaj Bojanczyk , Luc Segoufin

A stratified Lie system is a nonautonomous system of first-order ordinary differential equations on a manifold $M$ described by a $t$-dependent vector field $X=\sum_{\alpha=1}^rg_\alpha X_\alpha$, where $X_1,\ldots,X_r$ are vector fields on…

Mathematical Physics · Physics 2023-04-25 J. F. Cariñena , J. de Lucas , D. Wysocki

In this paper we present a fully lexicalized grammar formalism as a particularly attractive framework for the specification of natural language grammars. We discuss in detail Feature-based, Lexicalized Tree Adjoining Grammars (FB-LTAGs), a…

cmp-lg · Computer Science 2008-02-03 B. Srinivas , Dania Egedi , Christy Doran , Tilman Becker

Nominal algebra includes $\alpha$-equality and freshness constraints on nominal terms endowed with a nominal set semantics that facilitates reasoning about languages with binders. Nominal unification is decidable and unitary, however, its…

Logic in Computer Science · Computer Science 2024-12-18 Ali K. Caires-Santos , Maribel Fernández , Daniele Nantes-Sobrinho
‹ Prev 1 2 3 10 Next ›