ON DIOPHANTINE APPROXIMATIONS^)
... Scott [24] showed that if we restrict the fractions p/q to be from any one of the three classes (i) p, q both odd, (ii) p odd, q even, or (iii) p even, q odd, then there are infinitely many such p/q satisfying (1). Other proofs of this result have been given by Robinson [22], Oppenheim [20] and Kuip ...
... Scott [24] showed that if we restrict the fractions p/q to be from any one of the three classes (i) p, q both odd, (ii) p odd, q even, or (iii) p even, q odd, then there are infinitely many such p/q satisfying (1). Other proofs of this result have been given by Robinson [22], Oppenheim [20] and Kuip ...
Closed Sets of Higher
... connectives in classical propositional logic. Since classical propositional logic is complete with respect to the two-element boolean algebra, this question could naturally be rephrased in terms of finitary operations on the two-element boolean domain. While the language of propositional logic natur ...
... connectives in classical propositional logic. Since classical propositional logic is complete with respect to the two-element boolean algebra, this question could naturally be rephrased in terms of finitary operations on the two-element boolean domain. While the language of propositional logic natur ...
EXERCISES IN MA 510 : COMMUTATIVE ALGEBRA
... (ii) k(V ) is isomorphic to k(T −1 (V )) and (iii) OV,p is isomorphic to OT −1 (V ),T −1 (p) . (42) Consider the real affine quadrics: C = V (x2 + y 2 − 1), H = V (x2 − y 2 − 1) and P = V (x2 − y). (i) Determine the intersections of their projective closures C ∗ , H ∗ and P ∗ with the line at infini ...
... (ii) k(V ) is isomorphic to k(T −1 (V )) and (iii) OV,p is isomorphic to OT −1 (V ),T −1 (p) . (42) Consider the real affine quadrics: C = V (x2 + y 2 − 1), H = V (x2 − y 2 − 1) and P = V (x2 − y). (i) Determine the intersections of their projective closures C ∗ , H ∗ and P ∗ with the line at infini ...
An Automata Theoretic Decision Procedure for the Propositional Mu
... For example, occurrences of pX. X and vX.X merely trigger re-evaluation of themselves via the fixpoint property, while pX. (A ) X and vX. (A ) X can generate infinite sequences of reoccurrences along a chain of A edges. The presence or absence of nonterminating evaluations distinguishes least from g ...
... For example, occurrences of pX. X and vX.X merely trigger re-evaluation of themselves via the fixpoint property, while pX. (A ) X and vX. (A ) X can generate infinite sequences of reoccurrences along a chain of A edges. The presence or absence of nonterminating evaluations distinguishes least from g ...
On Countable Chains Having Decidable Monadic Theory.
... such that (A, <) contains a sub-interval of type or −, M is not maximal with respect to MSO logic, i.e., there exists an expansion M of M by a predicate which is not MSO definable in M , and such that the MSO theory of M is recursive in the one of M . In this paper we prove that this property ...
... such that (A, <) contains a sub-interval of type or −, M is not maximal with respect to MSO logic, i.e., there exists an expansion M of M by a predicate which is not MSO definable in M , and such that the MSO theory of M is recursive in the one of M . In this paper we prove that this property ...