Deposits of clastic carbonate-dominated (calciclastic) sedimentary slope systems in the rock record have been identified mostly as linearly-consistent carbonate apron deposits, even though most ancient clastic carbonate slope deposits fit the submarine fan systems better. Calciclastic submarine fans are consequently rarely described and are poorly understood. Subsequently, very little is known especially in mud-dominated calciclastic submarine fan systems. Presented in this study are a sedimentological core and petrographic characterisation of samples from eleven boreholes from the Lower Carboniferous of Bowland Basin (Northwest England) that reveals a >250 m thick calciturbidite complex deposited in a calciclastic submarine fan setting. Seven facies are recognised from core and thin section characterisation and are grouped into three carbonate turbidite sequences. They include: 1) Calciturbidites, comprising mostly of highto low-density, wavy-laminated bioclast-rich facies; 2) low-density densite mudstones which are characterised by planar laminated and unlaminated muddominated facies; and 3) Calcidebrites which are muddy or hyper-concentrated debrisflow deposits occurring as poorly-sorted, chaotic, mud-supported floatstones. These

Phd by thesis

From the Publisher:
Among the many approaches to formal reasoning about programs, Dynamic Logic enjoys the singular advantage of being strongly related to classical logic. Its variants constitute natural generalizations and extensions of classical formalisms. For example, Propositional Dynamic Logic (PDL) can be described as a blend of three complementary classical ingredients: propositional calculus, modal logic, and the algebra of regular events. In First-Order Dynamic Logic (DL), the propositional calculus is replaced by classical first-order predicate calculus. Dynamic Logic is a system of remarkable unity that is theoretically rich as well as of practical value. It can be used for formalizing correctness specifications and proving rigorously that those specifications are met by a particular program. Other uses include determining the equivalence of programs, comparing the expressive power of various programming constructs, and synthesizing programs from specifications. 
This book provides the first comprehensive introduction to Dynamic Logic. It is divided into three parts. The first part reviews the appropriate fundamental concepts of logic and computability theory and can stand alone as an introduction to these topics. The second part discusses PDL and its variants, and the third part discusses DL and its variants. Examples are provided throughout, and exercises and a short historical section are included at the end of each chapter.

Dynamic Logic

Publisher Summary This chapter focuses on finite automata on infinite sequences and infinite trees. The chapter discusses the complexity of the complementation process and the equivalence test. Deterministic Muller automata and nondeterministic Buchi automata are equivalent in recognition power. Any nonempty Rabin recognizable set contains a regular tree and shows that the emptiness problem for Rabin tree automata is decidable. The chapter discusses the formulation of two interesting generalizations of Rabin's Tree Theorem and presents some remarks on the undecidable extensions of the monadic theory of the binary tree. A short overview of the work that studies the fine structure of the class of Rabin recognizable sets of trees is also presented in the chapter. Depending on the formalism in which tree properties are classified, the results fall in three categories: monadic second-order logic, tree automata, and fixed-point calculi.

Automata on infinite objects

The subject of this chapter is the study of formal languages (mostly languages recognizable by finite automata) in the framework of mathematical logic.

/pdf/languages-automata-and-logic-418xw4tas7.pdf

Languages, automata, and logic

Fundamental facts Basic theory: Nuclear and exact $\textrm{C}^*$-algebras: Definitions, basic facts and examples Tensor products Constructions Exact groups and related topics Amenable traces and Kirchberg's factorization property Quasidiagonal C*-algebras AF embeddablity Local reflexivity and other tensor product conditions Summary and open problems Special topics: Simple $\textrm{C}^*$-algebras Approximation properties for groups Weak expectation property and local lifting property Weakly exact von Neumann algebras Applications: Classification of group von Neumann algebras Herrero's approximation problem Counterexamples in $\textrm{K}$-homology and $\textrm{K}$-theory Appendices: Ultrafilters and ultraproducts Operator spaces, completely bounded maps and duality Lifting theorems Positive definite functions, cocycles and Schoenberg's Theorem Groups and graphs Bimodules over von Neumann algebras Bibliography Notation index Subject index.

/pdf/c-algebras-and-finite-dimensional-approximations-56xyjjlcl8.pdf

C*-Algebras and Finite-Dimensional Approximations

Chapter I. Free Groups and Their Subgroups 1. Introduction 2. Nielsen's Method 3. Subgroups of Free Groups 4. Automorphisms of Free Groups 5. Stabilizers in Aut(F) 6. Equations over Groups 7. Quadratic sets of Word 8. Equations in Free Groups 9. Abstract Lenght Functions 10. Representations of Free Groups 11. Free Pruducts with Amalgamation Chapter II. Generators and Relations 1. Introduction 2. Finite Presentations 3. Fox Calculus, Relation Matrices, Connections with Cohomology 4. The Reidemeister-Schreier Method 5. Groups with a Single Defining Relator 6. Magnus' Treatment of One-Relator Groups Chapter III. Geometric Methods 1. Introduction 2. Complexes 3. Covering Maps 4. Cayley Complexes 5. Planar Caley Complexes 6. F-Groups Continued 7. Fuchsian Complexes 8. Planar Groups with Reflections 9. Singular Subcomplexes 10. Sherical Diagrams 11. Aspherical Groups 12. Coset Diagrams and Permutation Representations 13. Behr Graphs Chpter IV. Free Products and HNN Extensions 1. Free Products 2. Higman-Neumann-Neumann Extensions and Free Products with Amalgamation 3. Some Embedding Theorems 4. Some Decision Problems 5. One-Relator Groups 6. Bipolar Structures 7. The Higman Embedding Theorem 8. Algebraically Closed Groups Chapter V. Small Cancellation Theory 1. Diagrams 2. The Small Cancellation Hypotheses 3. The Basic Formulas 4. Dehn's Algorithm and Greendlinger's Lemma 5. The Conjugacy Problem 6. The Word Problem 7. The Cunjugacy Problme 8. Applications to Knot Groups 9. The Theory over Free Products 10. Small Cancellation Products 11. Small Cancellation Theory over free Products with Amalgamation and HNN Extensions Bibliography Index of Names Subject Index

Paul E. Schupp

Papers

Combinatorial Group Theory

The theory of ends, pushdown automata, and second-order logic

Groups, the Theory of ends, and context-free languages

Simulating alternating tree automata by nondeterministic automata: new results and new proofs of the theorems of Rabin, McNaughton and Safra

Generic-case complexity, decision problems in group theory, and random walks