中文
相关论文

相关论文: The theorem of the complement for nested subpfaffi…

200 篇论文

Let $G$ be a graph and $f: G\rightarrow G$ be a continuous map. We establish a structure theorem which describes the structures of the set $R(f)-\overline{P(f)}$, where $R(f)$ and $P(f)$ are the recurrent point set and the periodic point…

动力系统 · 数学 2023-10-31 Jiehua Mai , Enhui Shi , Kesong Yan , Fanping Zeng

Let R be an o-minimal expansion of the real field. We introduce a class of Hausdorff limits, the T-infinity limits over R, that do not in general fall under the scope of Marker and Steinhorn's definability-of-types theorem. We prove that if…

逻辑 · 数学 2011-07-05 Jean-Marie Lion , Patrick Speissegger

We prove the decidability for a class of languages which extend BST and NP-completeness for a subclass of them. The languages BST extended with unordered cartesian product, BST extended with ordered cartesian product and BST extended with…

逻辑 · 数学 2021-09-01 Pietro Ursino

We study a reduct L\ast of the ring language where multiplication is restricted to a neighbourhood of zero. The language is chosen such that for p-adically closed fields K, the L\ast-definable subsets of K coincide with the semi-algebraic…

逻辑 · 数学 2012-05-21 Eva Leenknegt

Arguments on PL,(=piecewise linear) topology work over any ordered field in the same way as over the real field, and those on differential topology do over a real closed field R in an o-minimal structure that expands (R,<,0,1,+,cdot). One…

逻辑 · 数学 2010-02-17 Masahiro Shiota

We let R be an o-minimal expansion of a field, V a convex subring, and $(R_0, V_{0})$ an elementary substructure of (R,V). We let L be the language consisting of a language for R, in which R has elimination of quantifiers, and a predicate…

逻辑 · 数学 2013-12-09 Clifton Ealy , Jana Maříková

A rigorous geometric proof of the Lie's Theorem on nonlinear superposition rules for solutions of non-autonomous ordinary differential equations is given filling in all the gaps present in the existing literature. The proof is based on an…

数学物理 · 物理学 2008-11-26 José F. Cariñena , Janusz Grabowski , Giuseppe Marmo

Given the family $P$ of all nonempty subsets of a set $U$ of alternatives, a choice over $U$ is a function $c \colon \Omega \to P$ such that $\Omega \subseteq P$ and $c(B) \subseteq B$ for all menus $B \in \Omega$. A choice is total if…

计算机科学中的逻辑 · 计算机科学 2022-12-05 Domenico Cantone , Alfio Giarlotta , Pietro Maugeri , Stephen Watson

Given a regular language L, we effectively construct a unary semigroup that recognizes the topological closure of L in the free unary semigroup relative to the variety of unary semigroups generated by the pseudovariety R of all finite…

群论 · 数学 2023-01-31 Jorge Almeida , José Carlos Costa , Marc Zeitoun

We present a first result towards the use of entailment in- side relational dual tableau-based decision procedures. To this end, we introduce a fragment of RL(1) which admits a restricted form of composition, (R ; S) or (R ; 1), where the…

计算机科学中的逻辑 · 计算机科学 2018-02-22 Domenico Cantone , Marianna Nicolosi-Asmundo , Ewa Orłowska

Let $E\supseteq F$ be a field extension and $M$ a graded Lie algebra of maximal class over $E$. We investigate the $F$-subalgebras $L$ of $M$, generated by elements of degree $1$. We provide conditions for $L$ being either ideally…

环与代数 · 数学 2023-11-14 Marina Avitabile , Norberto Gavioli , Valerio Monti

In this paper we address the decision problem for a fragment of set theory with restricted quantification which extends the language studied in [4] with pair related quantifiers and constructs, in view of possible applications in the field…

计算机科学中的逻辑 · 计算机科学 2012-10-10 Domenico Cantone , Cristiano Longo

Let $R\subset F$ be an extension of real closed fields and ${\mathcal S}(M,R)$ the ring of (continuous) semialgebraic functions on a semialgebraic set $M\subset R^n$. We prove that every $R$-homomorphism $\varphi:{\mathcal S}(M,R)\to F$ is…

代数几何 · 数学 2015-09-16 Jose F. Fernando

For a partially ordered set P, we denote by Co(P) the lattice of order-convex subsets of P. We find three new lattice identities, (S), (U), and (B), such that the following result holds. Theorem. Let L be a lattice. Then L embeds into some…

综合数学 · 数学 2007-05-23 Marina V. Semenova , Friedrich Wehrung

We present an extension to the quantifier-free theory of integer arrays which allows us to express counting. The properties expressible in Array Folds Logic (AFL) include statements such as "the first array cell contains the array length,"…

形式语言与自动机理论 · 计算机科学 2016-05-13 Przemysław Daca , Thomas A. Henzinger , Andrey Kupriyanov

Levi's theorem decomposes any arbitrary Lie algebra over a field of characteristic zero, as a direct sum of a semisimple Lie algebra (named Levi factor) and its solvable radical. Given a solvable Lie algebra $R$, a semisimple Lie algebra…

表示论 · 数学 2013-02-19 Pilar Benito , Daniel de-la-Concepción

Let p be prime number, K be a p-adically closed field, X $\subseteq$ K^m a semi-algebraic set defined over K and L(X) the lattice of semi-algebraic subsets of X which are closed in X. We prove that the complete theory of L(X) eliminates the…

逻辑 · 数学 2018-10-30 Luck Darnière

We prove a new fractional Helly theorem for families of sets obeying topological conditions. More precisely, we show that the nerve of a finite family of open sets (and of subcomplexes of cell complexes) in R^d is k-Leray where k depends on…

组合数学 · 数学 2007-05-23 Stephan Hell

We study structural and topological properties of nested set complexes of matroids with arbitrary building sets, proving that these complexes are vertex decomposable and admit convex ear decompositions. These results unify and generalize…

组合数学 · 数学 2026-01-19 Basile Coron , Luis Ferroni , Shiyue Li

In this paper we consider first-order logic theorem proving and model building via approximation and instantiation. Given a clause set we propose its approximation into a simplified clause set where satisfiability is decidable. The…

计算机科学中的逻辑 · 计算机科学 2015-05-22 Andreas Teucke , Christoph Weidenbach
‹ 上一页 1 2 3 10 下一页 ›