Ω-logic - PDFSEARCH.IO - Document Search Engine

Ω-logic
Results: 39

#	Item
21	Chapter 2 A Glimpse of Measure and Integration This chapter gives a quick but precise exposition of essentials of measure and integration so that an overall view of the subject is provided in good time. Add to Reading List Source URL: www.math.sinica.edu.tw Language: English - Date: 2013-10-18 07:14:45 Mathematical logic Boolean algebra Measure theory Sigma-algebra Probability space Ordinal number Borel set Ω-automaton Itō diffusion Mathematical analysis Probability theory Mathematics
22	Chapter 2 A Glimpse of Measure and Integration This chapter gives a quick but precise exposition of essentials of measure and integration so that an overall view of the subject is provided in good time. Add to Reading List Source URL: www.math.sinica.edu.tw Language: English - Date: 2014-05-26 04:51:49 Mathematical logic Boolean algebra Measure theory Sigma-algebra Probability space Ordinal number Borel set Ω-automaton Itō diffusion Mathematical analysis Probability theory Mathematics
23	Methods for the Transformation of ω-Automata: Complexity and Connection to Second Order Logic Diploma Thesis (Revised Version) Christof L¨oding Supervisor: Prof. Dr. Wolfgang Thomas Add to Reading List Source URL: www.automata.rwth-aachen.de Language: English - Date: 2012-05-29 10:55:56 Ω-automaton Nondeterministic finite automaton Muller automaton Finite-state machine Alternating finite automaton Sequence Powerset construction Automata theory Theoretical computer science Computer science
24	TUM ¨ R INFORMATIK INSTITUT FU Runtime verification revisited Oliver Arafat, Andreas Bauer, Martin Leucker, Christian Add to Reading List Source URL: www.immerundewig.at Language: English - Date: 2012-10-30 05:38:37 Formal languages Computer science Applied mathematics Linear temporal logic Temporal logic Ω-automaton Deterministic finite automaton Nondeterministic finite automaton Model theory Automata theory Theoretical computer science Models of computation
25	Theory of optimal control using bisimulations Mireille Broucke† , Maria Domenica Di Benedetto‡† , Stefano Di Gennaro‡ , and Alberto Sangiovanni-Vincentelli† † Dept. of Electrical Engineering and Computer Sci Add to Reading List Source URL: www.control.utoronto.ca Language: English - Date: 2005-08-28 20:39:10 Probability theory Mathematics Logic Ω-automaton Sigma-algebra Model theory Structure Universal algebra
26	Verifying time and communication costs of rule-based reasoners Natasha Alechina, Brian Logan, Nguyen Hoang Nga, and Abdur Rakib ⋆ University of Nottingham, Nottingham, UK (nza,bsl,hnn,rza)@cs.nott.ac.uk Add to Reading List Source URL: www.cs.nott.ac.uk Language: English - Date: 2009-02-27 06:28:19 Quantum information theory Ω-automaton Symbol Epistemic modal logic Automata theory
27	Verifying time and communication costs of rule-based reasoners Natasha Alechina, Brian Logan, Nguyen Hoang Nga, and Abdur Rakib ⋆ University of Nottingham, Nottingham, UK (nza,bsl,hnn,rza)@cs.nott.ac.uk Add to Reading List Source URL: www.cs.nott.ac.uk Language: English - Date: 2009-09-11 12:40:28 Quantum information theory Ω-automaton Symbol Epistemic modal logic Automata theory
28	Improving the Consistency Strength of Reflection at ℵω+1 Abstract: Reflection at ℵω+1 , the statement that every stationary subset of ℵω+1 has a reflection point below ℵω+1 , was shown to be consistent given Add to Reading List Source URL: www.math.caltech.edu Language: English - Date: 2012-01-20 14:18:22 Set theory Cardinal number Cofinality Supercompact cardinal Unfoldable cardinal Laver function Large cardinals Mathematical logic Mathematics
29	Checking Finite Traces using Alternating Automata ∗ Bernd Finkbeiner and Henny Sipma Computer Science Department, Stanford University Stanford, CA[removed]Abstract. Alternating automata have been commonly used as a basi Add to Reading List Source URL: www.verisoft.de Language: English - Date: 2013-04-11 05:48:57 Logic Model theory Theoretical computer science Linear temporal logic Temporal logic Ω-automaton Model checking Interpretation Structure Automata theory Formal languages Mathematics
30	Alan Kuhnle[removed]Theorem 1. With the Axiom of Choice, there exists an undetermined game on ω <ω . Proof. Notice that a strategy is a function σ : ω <ω → ω <ω . Thus, the set S := {σ : σ is a strategy } = Add to Reading List Source URL: alanmath.files.wordpress.com Language: English - Date: 2011-10-20 18:23:55 Cardinal numbers Beta amyloid Constructible universe Limit ordinal Insulin-degrading enzyme Θ Mathematical logic Set theory Ordinal numbers