Yet another version of Mumford’s theorem
نویسندگان
چکیده
منابع مشابه
Yet Another Proof of Cantor’s Theorem
We present various proofs of Cantor’s theorem in set theory: namely that the cardinality of the power set of a set X exceeds the cardinality of X, and in particular the continuum is uncountable. One of the proofs we present is inspired by Yablo’s non-self-referential Liar’s paradox, and it seems to bear a dual relationship to yet another proof.
متن کاملYet Another Proof of Marstrand’s Theorem
through the origin containing vθ and projθ : R 2 → Lθ the orthogonal projection. From now on, we’ll restrict θ to the interval [−π/2, π/2], because Lθ = Lθ+π. In 1954, J. M. Marstrand [10] proved the following result on the fractal dimension of plane sets. Theorem 1.1. If K ⊂ R is a Borel set such that HD(K) > 1, then m(projθ(K)) > 0 for m-almost every θ ∈ R. The proof is based on a qualitative...
متن کاملYAWL : Yet Another Workflow Language ( Revised version )
Based on a rigorous analysis of existing workflow management systems and workflow languages, a new workflow language is proposed: YAWL (Yet Another Workflow Language). To identify the differences between the various languages, we have collected a fairly complete set of workflow patterns. Based on these patterns we have evaluated several workflow products and detected considerable differences in...
متن کاملThe Heuristic Theorem Prover: Yet Another SMT Modulo Theorem Prover
HTP is an SMT Modulo theorem prover similar to many others.[2–6, 9, 11] As input, HTP accepts problems using the SMT-LIB format[8]. As output, HTP will answer either SAT, UNSAT or UNKNOWN. Alternatively, HTP can be run in a preprocessing mode in which the output is the simplified problem in SMTLIB format. An evidence file showing the derivation in a human readable form can be produced. There is...
متن کاملYet Another Decision Procedure for Equality Logic (full version)
We introduce a new decision procedure for Equality Logic. The procedure improves on Bryant and Velev’s sparse method [4] from CAV’00, in which each equality predicate is encoded with a Boolean variable, and then a set of transitivity constraints are added to compensate for the loss of transitivity of equality. We suggest the Reduced Transitivity Constraints (rtc) algorithm, that unlike the spar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Archiv der Mathematik
سال: 2015
ISSN: 0003-889X,1420-8938
DOI: 10.1007/s00013-015-0732-y