J. Barwise, editor. Handbook of Mathematical Logic, volume 90 of Studies in Logic and the Foundations of Mathematics. North-Holland Publishing Company, 1977. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
On Free Type Definitions in Z - Arthan (1992) (10 citations) (Correct)
....such as (2) to have a solution at all. The simplest example is when OE(X ) P(X ) For in that case (2) would conflict with a famous result of Cantor. Conditions under which such an equation does have a solution are considered in, for example, the section on Inductive Definitions by P. Aczel in [1]. The case discussed there is actually somewhat different from ours, in that Aczel is concerned with solutions to the equation OE(X ) X on the nose rather than up to a bijection, and he also is interested in the case where the domain and range of OE are contained in the power set of some ....
J. Barwise, editor. Handbook of Mathematical Logic, volume 90 of Studies in Logic and the Foundations of Mathematics. North Holland, 1977.
Proof Systems for Structured Specifications and Their Refinements - Bidoit, al. (1999) (4 citations) (Correct)
....(see, e.g. Men87] and the interpolation property. Thereby we say that satis es the interpolation property if the following holds: if 1 ( 2 where i is a i sentence with i (i = 1; 2) then there exists a ( 1 2 ) sentence 15 such that 1 ( and ( 2 [Bar77,BM86]. 16 The sentence is called interpolant. In equational logic, for example, interpolation does not hold [BHK90] 17 Classical and intuitionistic rst order predicate calculi [BM86] as well as the logic of partial terms [Bee85] satisfy interpolation. If INS has denumerable conjunctions and ....
Jon Barwise, editor. Handbook of Mathematical Logic, volume 90 of Studies in Logic and the Foundations of Mathematics. North-Holland Publishing Company, 1977.
Solving Bit-Vector Equations - A Decision Procedure for Hardware.. - Möller (1998) (1 citation) (Correct)
....ex2 C: all1 p : modtwo (p in A, p in B, p in C, p in Result) p 1 0) p 1 in C ) atleasttwo(p in A, p in B, p in C) 0 notin C) Figure 4. 1: A Simple Ripple Carry Adder in WS1S Note that the language WS1S is expressive enough to encode Presburger arithmetic (cf. Pre29] Bar93, Rabin: Decidable Theories] If each set is understood as a collection of bits (starting at position 0 as the least significant bit) this results in an intuitive encoding of IN . Addition with two summands is encoded by means of a ternary predicate, simulating a ripple carry adder (cf. Figure ....
Jon Barwise, editor. Handbook of mathematical logic, volume 90 of Studies in logic and the foundations of mathematics. North-Holland, Amsterdam, reprint edition, 1993.
Unification Modulo Presburger Arithmetic and Other.. -.. (Correct)
.... search for explicit solutions of existentially quanti ed formulae (essentially by the method of elimination of quanti ers) For theories decided by model theoretical methods, such as DNO (totally and densely orders) no explicit solutions are exposed (see Rabin s chapter on decidable theories in [Bar77]) In the context of the class of rewriting systems mentioned in this section e ective computation of the matching substitution can also be guaranteed giving syntactical restrictions on the conditional rewrite rules. One can, for example, restrict left hand sides of the conditions of the rules ....
J. Barwise, editor. Handbook of Mathematical Logic, volume 90 of Studies in Logic and the foundations of Mathematics. North-Holland, 1977.
Undefinedness in Z: Issues for Specification and Proof - Arthan (Correct)
....many of the details, let us assume that we start to develop set theory taking membership and equality as primitive predicates. The usual notation for sets (pairing, product, comprehension etc. can be introduced by conservative extension (see, for example, 7] 8] or the chapters on set theory in [1]) let us assume that that has been done, so that we can write expressions such as (x; y) x Theta y, fx : y j OE(x)g and so on. Let us assume that functions are represented in the usual way as sets of pairs and that function application is denoted by a 2 place function symbol, App. App(f; x) is ....
J. Barwise, editor. Handbook of Mathematical Logic, volume 90 of Studies in Logic and the Foundations of Mathematics. North Holland, 1977.
On Fragments of Analysis with Strengths of Finitely Iterated.. - Aehlig (Correct)
No context found.
J. Barwise, editor. Handbook of Mathematical Logic, volume 90 of Studies in Logic and the Foundations of Mathematics. North-Holland Publishing Company, 1977.
Proving First-Order Equality Theorems with Hyper-Linking - Alexander (1995) (4 citations) (Correct)
No context found.
Jon Barwise, editor. Handbook of Mathematical Logic, volume 90 of Studies of Logic and the Foundations of Mathematics. North-Holland Publishing Company, Amsterdam, 1977.
Embedding Built-in Predicates as Premises of Rules of Conditional .. - Rincón (1995) (1 citation) (Correct)
No context found.
J. Barwise, editor. Handbook of Mathematical Logic, volume 90 of Studies in Logic and the foundations of Mathematics. North-Holland, 1977.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC