Quantifier-free logic for nondeterministic theories (Q2369014): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2006.01.010
@@ Property / DOI: 10.1016/j.tcs.2006.01.010 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2006.01.010
+Normal rank
@@ Property / OpenAlex ID @@
+W2046478788
@@ Property / OpenAlex ID: W2046478788 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4250051
@@ Property / cites work: Q4250051 / rank @@
+Normal rank
@@ Property / cites work @@
+Reasoning with first order nondeterministic specifications
+Normal rank
@@ Property / cites work @@
+Institutions: abstract model theory for specification and programming
+Normal rank
@@ Property / cites work @@
+Q5287526
@@ Property / cites work: Q5287526 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4941933
@@ Property / cites work: Q4941933 / rank @@
+Normal rank
@@ Property / cites work @@
+Rasiowa-Sikorski deduction systems in computer science applications.
+Normal rank
@@ Property / cites work @@
+Specialization of the use of axioms for deduction search in axiomatic theories with equality
+Normal rank
@@ Property / cites work @@
+Q5734410
@@ Property / cites work: Q5734410 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2006.01.010
@@ Property / DOI: 10.1016/J.TCS.2006.01.010 / rank @@
+Normal rank