DOCSLIB.ORG

Volume 5 (2012), Number 3

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Volume 5 (2012), Number 3 APLIMAT - JOURNAL OF APPLIED MATHEMATICS VOLUME 5 (2012), NUMBER 3 APLIMAT - JOURNAL OF APPLIED MATHEMATICS VOLUME 5 (2012), NUMBER 3 Edited by: Slovak University of Technology in Bratislava Editor - in - Chief: KOVÁČOVÁ Monika (Slovak Republic) Editorial Board: CARKOVS Jevgenijs (Latvia ) CZANNER Gabriela (Great Britain) CZANNER Silvester (Great Britain) DOLEŽALOVÁ Jarmila (Czech Republic) FEČKAN Michal (Slovak Republic) FERREIRA M. A. Martins (Portugal) FRANCAVIGLIA Mauro (Italy) KARPÍŠEK Zdeněk (Czech Republic) KOROTOV Sergey (Finland) LORENZI Marcella Giulia (Italy) MESIAR Radko (Slovak Republic) VELICHOVÁ Daniela (Slovak Republic) Editorial Office: Institute of natural sciences, humanities and social sciences Faculty of Mechanical Engineering Slovak University of Technology in Bratislava Námestie slobody 17 812 31 Bratislava Correspodence concerning subscriptions, claims and distribution: F.X. spol s.r.o Dúbravská cesta 9 845 03 Bratislava 45 [email protected] Frequency: One volume per year consisting of three issues at price of 120 EUR, per volume, including surface mail shipment abroad. Registration number EV 2540/08 Information and instructions for authors are available on the address: http://www.journal.aplimat.com/ Printed by: FX spol s.r.o, Azalková 21, 821 00 Bratislava Copyright © STU 2007-2012, Bratislava All rights reserved. No part may be reproduced, stored in a retrieval system, or transmitted in any form or by any means, electronic, mechanical, photocopying, recording, or otherwise, without prior written permission from the Editorial Board. All contributions published in the Journal were reviewed with open and blind review forms with respect to their scientific contents. APLIMAT - JOURNAL OF APPLIED MATHEMATICS VOLUME 5 (2012), NUMBER 3 ALGEBRA AND ITS APPLICATIONS JASEM Milan: A CAUCHY COMPLETION OF DUALLY RESIDUATED 15 LATTICE ORDERED SEMIGROUPS SEIBERT Jaroslav: ON THE HYPER-WIENER INDEX AND 25 POLYNOMIAL OF A GRAPH. VANŽUROVÁ Alena : HEXAGONAL AND GOLDEN QUASIGROUPS 31 VANŽUROVÁ Alena, BARTOŠKOVÁ Zuzana: TOYODA'S 41 THEOREM AND QUASIGROUP MODES APLIMAT - JOURNAL OF APPLIED MATHEMATICS VOLUME 5 (2012), NUMBER 3 GEOMETRY AND ITS APPLICATIONS ARSAN Güler Gürpınar, ÇİVİ Gülçin: GEODESIC MAPPINGS 51 PRESERVING THE EINSTEIN TENSOR OF WEYL SPACES BASTL Bohumír, LÁVIČKA Miroslav: SMOOTH CURVES 57 APPROXIMATION BY CHORD-LENGTH CURVES BIZZARRI Michal, LÁVIČKA Miroslav: ON COMPUTING 67 APPROXIMATE PARAMETERIZATIONS OF ALGEBRAIC SURFACES ÇIVI Gülçin , ARSAN Güler Gürpınar: ON HOLOMORPHICALLY 79 PROJECTIVE MAPPINGS OF KAHLER- WEYL SPACES CHEPURNA Olena, MIKEŠ Josef: HOLOMORPHICALLY PROJECTIVE MAPPINGS OF HYPERBOLICALLY KAHLER SPACES 85 PRESERVING THE EINSTEIN TENSOR CHODOROVÁ Marie, CHUDÁ Hana, SHIHA Mohsen: ON COMPOSITION OF CONFORMAL AND HOLOMORPHICALLY 91 PROJECTIVE MAPPINGS BETWEEN CONFORMALLY K¨AHLERIAN SPACES JUKL Marek, JUKLOVÁ Lenka, MIKEŠ Josef: MULTIPLE 97 COVARIANT DERIVATIVE AND DECOMPOSITION PROBLEMS KAŇKA Miloš, ELIÁŠOVÁ Lada: THE CURVATURES OF SPECIAL 105 FUNCTIONS IN ECONOMY PETRASOVA Alena, CZANNER Silvester, CHALMERS Alan, WOLKE Dieter: THE UTILITY OF THE VIRTUAL REALITY IN DEEPER 113 UNDERSTANDING OF PEOPLE'S EXPERIENCES OF INFANT FEEDING SLABÁ Kristýna, BASTL Bohumír: CIRCLE-PRESERVING 123 SUBDIVISION SCHEME BASED ON APOLLONIUS' CIRCLE VANŽUROVÁ Alena, JUKL Marek: PARALLELOGRAM SPACES 133 AND MEDIAL QUASIGROUPS VANŽUROVÁ Alena, PIRKLOVÁ Petra: METRIZABLE CONNECTIONS AND RESTRICTIVELY VARIATIONAL CONNECTIONS 141 IN AFFINE MANIFOLDS VELICHOVÁ Daniela: MULTIDIMENSIONAL MANIFOLDS AS 151 MINKOWSKI OPERATION PRODUCTS VOICU Nicoleta: FINSLERIAN CONNECTIONS AND THE EQUATIONS 159 OF SPINNING CHARGED PARTICLES IN GENERAL RELATIVITY APLIMAT - JOURNAL OF APPLIED MATHEMATICS VOLUME 5 (2012), NUMBER 3 STATISTICAL METHODS IN TECHNICAL AND ECONOMIC SCIENCES AND PRACTICE ANDRADE Marina, FERREIRA Manuel Alberto M.: CRIME SCENE INVESTIGATION THROUGH DNA TRACES USING BAYESIAN 167 NETWORKS ANDRADE, Marina, FERREIRA, Manuel Alberto M.: CIVIL AND 173 CRIMINAL IDENTIFICATION WITH BAYESIAN NETWORKS ARSHINOVA Tatyana: RISK MANAGEMENT OF EQUITY PORTFOLIO CONSTRUCTION ON THE BASIS OF DATA 185 ENVELOPMENT ANALYSIS APPROACH BARTOŠOVÁ Jitka, FORBELSKÁ Marie: GMM MODEL OF AT- RISK-OF-POVERTY CZECH HOUSEHOLDS DEPENDING ON THE AGE 195 AND SEX OF THE HOUSEHOLDER (EU-SILC 2005-2009) BEZRUCKO Aleksandrs: LATVIAN GDP: TIME SERIES 205 FORECASTING USING VECTOR AUTO REGRESSION FERREIRA Manuel Alberto M., ANDRADE Marina: A METHOD TO APPROXIMATE FIRST PASSAGE TIMES DISTRIBUTIONS IN DIRECT 217 TIME MARKOV PROCESSES FERREIRA, Manuel Alberto M., ANDRADE, Marina: SOJOURN 225 TIMES IN JACKSON NETWORKS FJODOROVS Jegors, MATVEJEVS Andrejs: COPULA BASED 241 SEMIPARAMETRIC REGRESSIVE MODELS HECKENBERGEROVÁ Jana, MAREK Jaroslav, SOUČKOVÁ Jitka, TUČEK Pavel: NONSMOOTH FUNCTION APPROXIMATION IN 249 PRACTICAL CHANGE POINT PROBLEM JAROŠOVÁ Eva: COMPARISON OF TWO BAYESIAN APPROACHES 259 TO SPC MALÁ Ivana: QUANTILE CHARACTERISTICS OF CONDITIONAL 269 DISTRIBUTIONS OF FINITE MIXTURES MISKOLCZI Martina, LANGHAMROVÁ Jitka: MULTISTATE LIFE TABLES: APPLICATION OF THE METHOD ON THE MARRIAGE 279 CAREER MOŠNA František: TWO APPLICATIONS OF PROBABILITY IN THE 287 THEORY OF RELIABILITY AND MAINTENANCE NEUBAUER Jiří: INFLATION MODELING AND COINTEGRATION 293 ŽIŽKA David: APPLICATION OF RELEVANCE VECTOR MACHINE TO 301 FORECASTING VOLATILITY IN CZECH FINANCIAL TIME SERIES LIST OF REVIEWERS Andrade Marina, Professor Auxiliar University Institute of Lisbon, Lisboa, Portugal Bartošová Jitka, RNDr., PhD University of Economics, Jindřichův Hradec, Czech Republic Baštinec Jaromír, doc. RNDr., CSc. FEEC, Brno University of Technology, Brno, Czech Republic Beránek Jaroslav, doc. RNDr., CSc. Masaryk University, Brno, Czech Republic Biswas Md. Haider Ali, Associate Engineering and Technology School, Khulna Professor University, Belize Bittnerová Daniela, RNDr., CSc. Technical Univerzity of Liberec, Liberec, Czech Republic Brabec Marek, Ing., PhD Academy of Sciences of the Czech Republic, Praha, Czech Republic Buikis Maris, Prof. Dr. Riga Technical University, Riga, Latvia Cyhelský Lubomír, Prof. Ing., DrSc. Vysoká škola finanční a správní, Praha, Czech Republic Dorociaková Božena, RNDr., PhD University of Žilina, Žilina, Slovak Republic Emanovský Petr, Doc. RNDr., PhD Palacky University, Olomouc, Czech Republic Ferreira Manuel Alberto M., Professor University Institute of Lisbon, Lisboa, Portugal Catedrático Filipe José António, Professor Auxiliar IBS - IUL, ISCTE - IUL, Lisboa , Portugal Habiballa Hashim, RNDr. PaedDr., University of Ostrava, Ostrava, Czech Republic PhD Habiballa Hashim, RNDr. PaedDr., University of Ostrava, Ostrava, Czech Republic PhD Hošková-Mayerová Šárka, doc. University of Defence, Brno, Czech Republic RNDr., PhD 11 Hošpesová Alena, doc. PhDr., PhD Jihočeská univerzita, České Budějovice, Czech Republic Iorfida Vincenzo Lamezia Terme, Italy Iveta Stankovičová, PhD UK Bratislava, Bratislava, Slovak Republic Jancarik Antonin, PhD Charles University, Prague, Czech Republic Jukl Marek, RNDr., PhD Palacky University, Olomouc, Czech Republic Kráľ Pavol, RNDr., PhD Matej Bel University, Banska Bystrica, Slovak Republic Kunderová Pavla, doc. RNDr., CSc. Palacky University, Olomouc, Czech Republic Kvasz Ladislav, Prof. Charles University, Prague, Czech Republic Langhamrová Jitka, doc. Ing., CSc University of Economic in Prague, Prague Czech Republic Linda Bohdan, doc. RNDr., CSc. University of Pardubice, Pardubice, Czech Republic Maroš Bohumil, doc. RNDr., CSc. University of Technology, Brno, Czech Republic Matvejevs Andrejs, DrSc., Ing. Riga Technical university, Riga, Latvia Mikeš Josef, Prof. RNDr., DrSc. Palacky University, Olomouc, Czech Republic Milerová Helena, Bc. Charles University, Prague, Czech Republic Miroslav Husek Charles University, Prague, Czech Republic Miskolczi Martina, Mgr., Ing. University of Economics in Prague, Prague, Czech Republic Morkisz Paweł, AGH University of Science and Technology, Krakow, Poland Mošna František, RNDr., PhD Czech Univ. of Life Sciences, Praha, Czech Republic Paláček Radomir, RNDr., PhD VŠB - Technical University of Ostrava, Ostrava, Czech Republic Pospíšil Jiří, Prof. Ing., CSc. Czech Technical University of Prague, Prague, Czech Republic 12 Potůček Radovan, RNDr., PhD University of Defence, Brno, Czech Republic Radova Jarmila, doc. RNDr., PhD University of Economics, Prague, Czech Republic Rus Ioan A., Professor Babes-Bolyai University of Cluj-Napoca, Cluj-Napoca, Romania Růžičková Miroslava, doc. RNDr., University of Žilina, Žilina, Slovak Republic CSc. Segeth Karel, Prof. RNDr., CSc. Academy of Sciences of the Czech Republic, Prague , Czech Republic Slaby Antonin, Prof. RNDr., PhDr., University of Hradec Kralove, Hradec Kralove, Czech CSc. Republic Sousa Cristina Alexandra, Master Universidade Portucalense Infante D. Henrique, Porto, Portugal Svoboda Zdeněk, RNDr., CSc. FEEC, Brno University of Technology, Brno, Czech Republic Šamšula Pavel, doc. PaedDr., CSc Charles University, Prague, Czech Republic Torre Matteo, Laurea in Matematica Scula Secondaria Superiore, Alessandria, Italy Trojovsky Pavel, RNDr., PhD University of Hradec Kralove, Hradec Kralove, Czech Republic Trokanová Katarína, Doc. Slovak Technical University, Bratislava, Slovak Republic Ulrychová Eva, RNDr. University of Finance and Administration, Prague, Czech Republic Vanžurová Alena, doc. RNDr., CSc. Palacký University, Olomouc, Czech Republic Velichová Daniela, doc. RNDr., CSc. Slovak University of Technology, Bratislava, Slovak mim.prof.
Load more

Recommended publications
  • EM-Training for Weighted Aligned Hypergraph Bimorphisms
    EM-Training for Weighted Aligned Hypergraph Bimorphisms Frank Drewes Kilian Gebhardt and Heiko Vogler Department of Computing Science Department of Computer Science Umea˚ University Technische Universitat¨ Dresden S-901 87 Umea,˚ Sweden D-01062 Dresden, Germany [email protected] [email protected] [email protected] Abstract malized by the new concept of hybrid grammar. Much as in the mentioned synchronous grammars, We develop the concept of weighted a hybrid grammar synchronizes the derivations aligned hypergraph bimorphism where the of nonterminals of a string grammar, e.g., a lin- weights may, in particular, represent proba- ear context-free rewriting system (LCFRS) (Vijay- bilities. Such a bimorphism consists of an Shanker et al., 1987), and of nonterminals of a R 0-weighted regular tree grammar, two ≥ tree grammar, e.g., regular tree grammar (Brainerd, hypergraph algebras that interpret the gen- 1969) or simple definite-clause programs (sDCP) erated trees, and a family of alignments (Deransart and Małuszynski, 1985). Additionally it between the two interpretations. Seman- synchronizes terminal symbols, thereby establish- tically, this yields a set of bihypergraphs ing an explicit alignment between the positions of each consisting of two hypergraphs and the string and the nodes of the tree. We note that an explicit alignment between them; e.g., LCFRS/sDCP hybrid grammars can also generate discontinuous phrase structures and non- non-projective dependency structures. projective dependency structures are bihy- In this paper we focus on the task of training an pergraphs. We present an EM-training al- LCFRS/sDCP hybrid grammar, that is, assigning gorithm which takes a corpus of bihyper- probabilities to its rules given a corpus of discon- graphs and an aligned hypergraph bimor- tinuous phrase structures or non-projective depen- phism as input and generates a sequence dency structures.
    [Show full text]
  • Domain Theory and the Logic of Observable Properties
    Domain Theory and the Logic of Observable Properties Samson Abramsky Submitted for the degree of Doctor of Philosophy Queen Mary College University of London October 31st 1987 Abstract The mathematical framework of Stone duality is used to synthesize a number of hitherto separate developments in Theoretical Computer Science: • Domain Theory, the mathematical theory of computation introduced by Scott as a foundation for denotational semantics. • The theory of concurrency and systems behaviour developed by Milner, Hennessy et al. based on operational semantics. • Logics of programs. Stone duality provides a junction between semantics (spaces of points = denotations of computational processes) and logics (lattices of properties of processes). Moreover, the underlying logic is geometric, which can be com- putationally interpreted as the logic of observable properties—i.e. properties which can be determined to hold of a process on the basis of a finite amount of information about its execution. These ideas lead to the following programme: 1. A metalanguage is introduced, comprising • types = universes of discourse for various computational situa- tions. • terms = programs = syntactic intensions for models or points. 2. A standard denotational interpretation of the metalanguage is given, assigning domains to types and domain elements to terms. 3. The metalanguage is also given a logical interpretation, in which types are interpreted as propositional theories and terms are interpreted via a program logic, which axiomatizes the properties they satisfy. 2 4. The two interpretations are related by showing that they are Stone duals of each other. Hence, semantics and logic are guaranteed to be in harmony with each other, and in fact each determines the other up to isomorphism.
    [Show full text]
  • Algebraic Implementation of Abstract Data Types*
    Theoretical Computer Science 20 (1982) 209-263 209 North-Holland Publishing Company ALGEBRAIC IMPLEMENTATION OF ABSTRACT DATA TYPES* H. EHRIG, H.-J. KREOWSKI, B. MAHR and P. PADAWITZ Fachbereich Informatik, TV Berlin, 1000 Berlin 10, Fed. Rep. Germany Communicated by M. Nivat Received October 1981 Abstract. Starting with a review of the theory of algebraic specifications in the sense of the ADJ-group a new theory for algebraic implementations of abstract data types is presented. While main concepts of this new theory were given already at several conferences this paper provides the full theory of algebraic implementations developed in Berlin except of complexity considerations which are given in a separate paper. The new concept of algebraic implementations includes implementations for algorithms in specific programming languages and on the other hand it meets also the requirements for stepwise refinement of structured programs and software systems as introduced by Dijkstra and Wirth. On the syntactical level an algebraic implementation corresponds to a system of recursive programs while the semantical level is defined by algebraic constructions, called SYNTHESIS, RESTRICTION and IDENTIFICATION. Moreover the concept allows composition of implementations and a rigorous study of correctness. The main results of the paper are different kinds of correctness criteria which are applied to a number of illustrating examples including the implementation of sets by hash-tables. Algebraic implementations of larger systems like a histogram or a parts system are given in separate case studies which, however, are not included in this paper. 1. Introduction The concept of abstract data types was developed since about ten years starting with the debacles of large software systems in the late 60's.
    [Show full text]
  • Categories of Coalgebras with Monadic Homomorphisms Wolfram Kahl
    Categories of Coalgebras with Monadic Homomorphisms Wolfram Kahl To cite this version: Wolfram Kahl. Categories of Coalgebras with Monadic Homomorphisms. 12th International Workshop on Coalgebraic Methods in Computer Science (CMCS), Apr 2014, Grenoble, France. pp.151-167, 10.1007/978-3-662-44124-4_9. hal-01408758 HAL Id: hal-01408758 https://hal.inria.fr/hal-01408758 Submitted on 5 Dec 2016 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Distributed under a Creative Commons Attribution| 4.0 International License Categories of Coalgebras with Monadic Homomorphisms Wolfram Kahl McMaster University, Hamilton, Ontario, Canada, [email protected] Abstract. Abstract graph transformation approaches traditionally con- sider graph structures as algebras over signatures where all function sym- bols are unary. Attributed graphs, with attributes taken from (term) algebras over ar- bitrary signatures do not fit directly into this kind of transformation ap- proach, since algebras containing function symbols taking two or more arguments do not allow component-wise construction of pushouts. We show how shifting from the algebraic view to a coalgebraic view of graph structures opens up additional flexibility, and enables treat- ing term algebras over arbitrary signatures in essentially the same way as unstructured label sets.
    [Show full text]
  • Abstraction and Abstraction Refinement in the Verification Of
    Abstraction and Abstraction Refinement in the Verification of Graph Transformation Systems Vom Fachbereich Ingenieurwissenschaften Abteilung Informatik und angewandte Kognitionswissenschaft der Unversit¨at Duisburg-Essen zur Erlangung des akademischen Grades eines Doktor der Naturwissenschaften (Dr.-rer. nat.) genehmigte Dissertation von Vitaly Kozyura aus Magadan, Russland Referent: Prof. Dr. Barbara K¨onig Korreferent: Prof. Dr. Arend Rensink Tag der m¨undlichen Pr¨ufung: 05.08.2009 Abstract Graph transformation systems (GTSs) form a natural and convenient specification language which is used for modelling concurrent and distributed systems with dynamic topologies. These can be, for example, network and Internet protocols, mobile processes with dynamic behavior and dynamic pointer structures in programming languages. All this, together with the possibility to visualize and explain system behavior using graphical methods, makes GTSs a well-suited formalism for the specification of complex dynamic distributed systems. Under these circumstances the problem of checking whether a certain property of GTSs holds – the verification problem – is considered to be a very important question. Unfortunately the verification of GTSs is in general undecidable because of the Turing- completeness of GTSs. In the last few years a technique for analysing GTSs based on approximation by Petri graphs has been developed. Petri graphs are Petri nets having additional graph structure. In this work we focus on the verification techniques based on counterexample-guided abstraction refinement (CEGAR approach). It starts with a coarse initial over-approxi- mation of a system and an obtained counterexample. If the counterexample is spurious then one starts a refinement procedure of the approximation, based on the structure of the counterexample.
    [Show full text]
  • Syntax and Semantics in Algebra Jean-François Nicaud, Denis Bouhineau, Jean-Michel Gélis
    Syntax and semantics in algebra Jean-François Nicaud, Denis Bouhineau, Jean-Michel Gélis To cite this version: Jean-François Nicaud, Denis Bouhineau, Jean-Michel Gélis. Syntax and semantics in algebra. Pro- ceedings of the 12th ICMI Study Conference. The University of Melbourne, 2001, Australia. 12 p. hal-00962023 HAL Id: hal-00962023 https://hal.archives-ouvertes.fr/hal-00962023 Submitted on 25 Mar 2014 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. 1 Syntax and Semantics in Algebra Jean-François Nicaud, Denis Bouhineau Jean-Michel )*lis I IN, University of Nantes, France IUFM of Versailles, France $bouhineau, nicaud%&irin.univ-nantes.fr gelis&inrp.fr This paper is the first chapter of a cognitive, didactic and computatio- nal theory of algebra that presents, in a formal .ay, .ell /no.n elements of mathematics 0numbers, functions and polynomials1 as semantic ob2ects, and expressions as syntactic constructions. The lin/ bet.een syntax and semantics is realised by morphisms. The paper highlights preferred semantics for algebra and defines formally algebraic problems. 3ey.ords4 syntax, semantics, formalisation, algebraic problem. Introduction This paper describes a theory of algebra .ith cognitive, didactic and computational features.
    [Show full text]
  • Lecture Notes for MATH 770 : Foundations of Mathematics — University of Wisconsin – Madison, Fall 2005
    Lecture notes for MATH 770 : Foundations of Mathematics — University of Wisconsin – Madison, Fall 2005 Ita¨ıBEN YAACOV Ita¨ı BEN YAACOV, Institut Camille Jordan, Universite´ Claude Bernard Lyon 1, 43 boulevard du 11 novembre 1918, 69622 Villeurbanne Cedex URL: http://math.univ-lyon1.fr/~begnac/ c Ita¨ıBEN YAACOV. All rights reserved. CONTENTS Contents Chapter 1. Propositional Logic 1 1.1. Syntax 1 1.2. Semantics 3 1.3. Syntactic deduction 6 Exercises 12 Chapter 2. First order Predicate Logic 17 2.1. Syntax 17 2.2. Semantics 19 2.3. Substitutions 22 2.4. Syntactic deduction 26 Exercises 35 Chapter 3. Model Theory 39 3.1. Elementary extensions and embeddings 40 3.2. Quantifier elimination 46 Exercises 51 Chapter 4. Incompleteness 53 4.1. Recursive functions 54 4.2. Coding syntax in Arithmetic 59 4.3. Representation of recursive functions 64 4.4. Incompleteness 69 4.5. A “physical” computation model: register machines 71 Exercises 75 Chapter 5. Set theory 77 5.1. Axioms for set theory 77 5.2. Well ordered sets 80 5.3. Cardinals 86 Exercises 94 –sourcefile– iii Rev: –revision–, July 22, 2008 CONTENTS 1.1. SYNTAX CHAPTER 1 Propositional Logic Basic ingredients: • Propositional variables, which will be denoted by capital letters P,Q,R,..., or sometimes P0, P1, P2,.... These stand for basic statements, such as “the sun is hot”, “the moon is made of cheese”, or “everybody likes math”. The set of propositional variables will be called vocabulary. It may be infinite. • Logical connectives: ¬ (unary connective), →, ∧, ∨ (binary connectives), and possibly others. Each logical connective is defined by its truth table: A B A → B A ∧ B A ∨ B A ¬A T T T T T T F T F F F T F T F T T F T F F T F F Thus: • The connective ¬ means “not”: ¬A means “not A”.
    [Show full text]
  • Abstract Data Types
    1 Abstract data types The history of programming languages may be characterized as the genesis of increasingly powerful abstractions to aid the development of reliable programs. Abstract data types 8 1-1 abstraction and types • algebraic specification • modules versus classes • types as constraints • Additional keywords and phrases: control abstractions, data abstractions, compiler support, description systems, behavioral specification, imple- mentation specification Slide 1-1: Abstract data types In this chapter we will look at the notion of abstract data types, which may be regarded as an essential constituent of object-oriented modeling. In particular, we will study the notion of data abstraction from a foundational perspective, that is based on a mathematical description of types. We start this chapter by discussing the notion of types as constraints. Then, we look at the (first order) algebraic specification of abstract data types, and we explore the trade- offs between the traditional implementation of abstract data types by employing 1 2 Abstract data types modules and the object-oriented approach employing classes. We conclude this chapter by exploring the distinction between classes and types, as a preparation for the treatment of (higher order) polymorphic type theories for object types and inheritance in the next chapter. 1.1 Abstraction and types The concern for abstraction may be regarded as the driving force behind the development of programming languages (of which there are astoundingly many). In the following we will discuss the role of abstraction in programming, and especially the importance of types. We then briefly look at what mathematical means we have available to describe types from a foundational perspective and what we may (and may not) expect from types in object-oriented programming.
    [Show full text]
  • Algebraic Semantics Abstract Type Whose Values Are Lists of Algebraic Semantics Involves the Algebraic Integers: Specification of Data and Language Constructs
    Algebraic Semantics Abstract type whose values are lists of Algebraic semantics involves the algebraic integers: specification of data and language constructs. Sorts = { Integer, Boolean, List }. Function symbols with their signatures: Foundations based on abstract algebras. zero : Integer Basic idea one : Integer • Name the sorts of objects and the operations plus ( _ , _ ) : Integer, Integer ! Integer on the objects. minus ( _ , _ ) : Integer, Integer ! Integer • Use algebraic axioms to describe their characteristic properties. true : Boolean false : Boolean An algebraic specification contains two parts: emptyList : List signature and equations. cons ( _ , _ ) : Integer, List ! List A signature # of an algebraic specification head ( _ ) : List ! Integer is a pair <Sorts, Operations> where tail ( _ ) : List ! List • Sorts is a set containing names of sorts. empty? ( _ ) : List ! Boolean • Operations is a family of function symbols length ( _ ) : List ! Integer indexed by the functionalities of the operations represented by the function symbols. Chapter 12 1 Chapter 12 2 Family of operations decomposes: Module Representation OprBoolean = { true, false } OprInteger,Integer!Integer = { plus, minus } • Decompose definitions into relatively small OprList!Integer = { head, length } components. Equations constrain the operations to indicate • Import the signature and equations of one the appropriate behavior for the operations. module into another. head (cons (m, s)) = m, empty? (emptyList) = true • Define sorts and functions to be either exported or hidden. empty? (cons (m, s)) = false. Each stands for a closed assertion: • Modules can be parameterized to define generic abstract data types. "m:Integer, "s:List [head (cons (m, s)) = m]. empty? (emptyList) = true "m:Integer, "s:List [empty? (cons (m, s))= false].
    [Show full text]
  • The Agda Universal Algebra Library Part 2: Structure Homomorphisms, Terms, Classes of Algebras, Subalgebras, and Homomorphic Images
    The Agda Universal Algebra Library Part 2: Structure Homomorphisms, terms, classes of algebras, subalgebras, and homomorphic images William DeMeo a S Department of Algebra, Charles University in Prague Abstract The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) we developed to formalize the foundations of universal algebra in dependent type theory using the Agda programming language and proof assistant. The UALib includes a substantial collection of definitions, theorems, and proofs from universal algebra, equational logic, and model theory, and as such provides many examples that exhibit the power of inductive and dependent types for representing and reasoning about mathematical structures and equational theories. In this paper, we describe the the types and proofs of the UALib that concern homomorphisms, terms, and subalgebras. 2012 ACM Subject Classification Theory of computation → Logic and verification; Computing meth- odologies → Representation of mathematical objects; Theory of computation → Type theory Keywords and phrases Agda, constructive mathematics, dependent types, equational logic, extension- ality, formalization of mathematics, model theory, type theory, universal algebra Related Version hosted on arXiv Part 1, Part 3: http://arxiv.org/a/demeo_w_1 Supplementary Material Documentation: ualib.org Software: https://gitlab.com/ualib/ualib.gitlab.io.git Contents 1 Introduction 2 1.1 Motivation ....................................... 2 1.2 Attributions and Contributions ...........................
    [Show full text]
  • Lectures on Universal Algebra
    Lectures on Universal Algebra Matt Valeriote McMaster University November 8, 1999 1 Algebras In this ¯rst section we will consider some common features of familiar alge- braic structures such as groups, rings, lattices, and boolean algebras to arrive at a de¯nition of a general algebraic structure. Recall that a group G consists of a nonempty set G, along with a binary ¡1 operation ¢ : G ! G, a unary operation : G ! G, and a constant 1G such that ² x ¢ (y ¢ z) = (x ¢ y) ¢ z for all x, y, z 2 G, ¡1 ¡1 ² x ¢ x = 1G and x ¢ x = 1G for all x 2 G, ² 1G ¢ x = x and x ¢ 1G = x for all x 2 G. A group is abelian if it additionally satis¯es: x ¢ y = y ¢ x for all x, y 2 G. A ring R is a nonempty set R along with binary operations +, ¢, a unary operation ¡, and constants 0R and 1R which satisfy ² R, along with +, ¡, and 0R is an abelian group. ² x ¢ (y ¢ z) = (x ¢ y) ¢ z for all x, y, z 2 G. ² x ¢ (y + z) = (x ¢ y) + (x ¢ z) and (y + z) ¢ x = (y ¢ x) + (z ¢ x) for all x, y, z 2 G. 1 ² 1G ¢ x = x and x ¢ 1G = x for all x 2 G. Lattices are algebras of a di®erent nature, they are essentially an algebraic encoding of partially ordered sets which have the property that any pair of elements of the ordered set has a least upper bound and a greatest lower bound. A lattice L consists of a nonempty set L, equipped with two binary operations ^ and _ which satisfy: ² x ^ x = x and x _ x = x for all x 2 L, ² x ^ y = y ^ x and x _ y = y _ x for all x, y 2 L, ² x ^ (y _ x) = x and x _ (y ^ x) = x for all x, y 2 L.
    [Show full text]
  • Domain Theory Corrected and Expanded Version Samson Abramsky1 and Achim Jung2
    Domain Theory Corrected and expanded version Samson Abramsky1 and Achim Jung2 This text is based on the chapter Domain Theory in the Handbook of Logic in Com- puter Science, volume 3, edited by S. Abramsky, Dov M. Gabbay, and T. S. E. Maibaum, published by Clarendon Press, Oxford in 1994. While the numbering of all theorems and definitions has been kept the same, we have included comments and corrections which we have received over the years. For ease of reading, small typo- graphical errors have simply been corrected. Where we felt the original text gave a misleading impression, we have included additional explanations, clearly marked as such. If you wish to refer to this text, then please cite the published original version where possible, or otherwise this on-line version which we try to keep available from the page http://www.cs.bham.ac.uk/˜axj/papers.html We will be grateful to receive further comments or suggestions. Please send them to [email protected] So far, we have received comments and/or corrections from Liang-Ting Chen, Francesco Consentino, Joseph D. Darcy, Mohamed El-Zawawy, Miroslav Haviar, Weng Kin Ho, Klaus Keimel, Olaf Klinke, Xuhui Li, Homeira Pajoohesh, Dieter Spreen, and Dominic van der Zypen. 1Computing Laboratory, University of Oxford, Wolfson Building, Parks Road, Oxford, OX1 3QD, Eng- land. 2School of Computer Science, University of Birmingham, Edgbaston, Birmingham, B15 2TT, England. Contents 1 Introduction and Overview 5 1.1 Origins ................................. 5 1.2 Ourapproach .............................. 7 1.3 Overview ................................ 7 2 Domains individually 10 2.1 Convergence .............................
    [Show full text]