An axiomatization of full Computation Tree Logic (Q2758043): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2153737593
@@ Property / OpenAlex ID: W2153737593 / rank @@
+Normal rank
@@ Property / cites work @@
+\(R\)-generability, and definability in branching time logics
+Normal rank
@@ Property / cites work @@
+Decidability for branching time
@@ Property / cites work: Decidability for branching time / rank @@
+Normal rank
@@ Property / cites work @@
+Testing and generating infinite sequences by a finite automaton
+Normal rank
@@ Property / cites work @@
+Q3835817
@@ Property / cites work: Q3835817 / rank @@
+Normal rank
@@ Property / cites work @@
+Deciding full branching time logic
@@ Property / cites work: Deciding full branching time logic / rank @@
+Normal rank
@@ Property / cites work @@
+Ockhamist Computational Logic: Past-Sensitive Necessitation in CTL
+Normal rank
@@ Property / cites work @@
+Non-definability of the class of complete bundled trees
+Normal rank
@@ Property / cites work @@
+Branching-time logic with quantification over branches: The point of view of modal logic
+Normal rank
@@ Property / cites work @@
+A finite axiomatization of the set of strongly valid Ockhamist formulas
+Normal rank
@@ Property / cites work @@
+Handbook of philosophical logic. Volume II: Extensions of classical logic
+Normal rank