query: setting counters for Lemmas proposition etc
positive_passages.docid: 147912
positive_passages.text: Cross-referencing problem if counter of theorem-like environments is shared
negative_passages.docid: 34833
negative_passages.text: COUNT(*) vs. COUNT(1) vs. COUNT(pk): which is better?
negative_passages.docid: 47222
negative_passages.text: Soundness of a rule of a proof system with respect to the truth tables?
negative_passages.docid: 95864
negative_passages.text: beamer: Different numbering for Theorems, Examples, Definition, and Lemma
negative_passages.docid: 77210
negative_passages.text: Zorn's Lemma and Posets
negative_passages.docid: 150385
negative_passages.text: The use of the Axiom of Choice in this proof of the sequence lemma
negative_passages.docid: 32897
negative_passages.text: Dos and Don'ts of \countdef\mycount= and \newcount vs \newcounter{} in LaTeX
negative_passages.docid: 154832
negative_passages.text: Show that there is always a proposition between two propositions logic
negative_passages.docid: 113065
negative_passages.text: Proving equivalences of statements equivalent to AC
negative_passages.docid: 4303
negative_passages.text: Enumerating inside a proposition and inside a proof
negative_passages.docid: 92124
negative_passages.text: Spacing of relation and operation symbols with propositions
negative_passages.docid: 25347
negative_passages.text: amsthm with shared counters messes up autoref references
negative_passages.docid: 60635
negative_passages.text: Does C++ support compile-time counters?
negative_passages.docid: 9204
negative_passages.text: Counterexamples to the avoidance lemma for arbitrary ideals
negative_passages.docid: 95886
negative_passages.text: ConTeXt and Metafun: Framed enumeration with counter as part of overlay
negative_passages.docid: 133617
negative_passages.text: Relatively prime property verification
negative_passages.docid: 3217
negative_passages.text: Construction of uncountably many non-isomorphic linear (total) orderings of natural numbers