Trees of Definable Sets Over the P-Adics

Journal für die Reine und Angewandte Mathematik - Germany
doi 10.1515/crelle.2010.040
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Walter de Gruyter GmbH

Related search

Inclusion Constraints Over Non-Empty Sets of Trees

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1997English

Pseudovaluation Domains With Vapnik-Chervonenkis Classes of Definable Sets

Communications in Algebra
Number TheoryAlgebra
2000English

The Definable (P, Q)-Theorem for Distal Theories

Journal of Symbolic Logic
PhilosophyLogic
2017English

Rough Sets for Trees of Executions

2017English

Trees With Unique Minimum Dominating Sets

International Journal of Soft Computing, Mathematics and Control
2015English

Minimal 2-Dominating Sets in Trees

RAIRO - Theoretical Informatics and Applications
MathematicsComputer Science ApplicationsSoftware
2013English

Steiner Minimal Trees on Sets of Four Points

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
1987English

Definable Singularity

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1991English

Consistency of Linear Inequalities Over Sets

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1972English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy