4.2 First-Order Logic
|
|
- Curtis Hampton
- 6 years ago
- Views:
Transcription
1 64 First-Order Logic and Type Theory The problem can be seen in the two qestionable rles In the existential introdction, the term a has not yet been introdced into the derivation and its se can therefore not be jstified Related is the incorrect application of the E rle It is spposed to introdce a new parameter a and a new assmption w However, a occrs in the conclsion, invalidating this inference In this case, the flaw can be repaired by moving the existential elimination downward, in effect introdcing the parameter into the derivation earlier (when viewed from the perspective of normal proof constrction) x nat A(s(x)) tre a a nat natis w s(a) nat A(s(a)) tre I y nat A(y) tre E a,w y nat A(y) tre I ( x nat A(s(x))) y nat A(y) tre Of corse there are other cases where the flawed rle cannot be repaired For example, it is easy to constrct an incorrect derivation of ( x τ A(x)) x τ A(x) 42 First-Order Logic First-order logic, also called the predicate calcls, is concerned with the stdy of propositions whose qantifiers range over a domain abot which we make no assmptions In or case this means we allow only qantifiers of the form x τ A(x) and x τ A(x) that are parametric in a type τ We assme only that τ type, bt no other property of τ When we add particlar types, sch as natral nmbers nat or lists τ list, we say that we reason within specific theories The theory of natral nmbers, for example, is called arithmetic When we allow essentially arbitrary propositions and types explained via introdction and elimination constrcts (inclding fnction types, prodct types, etc) we say that we reason in type theory It is important that type theory is open-ended: we can always add new propositions and new types and even new jdgment forms, as long as we can explain their meaning satisfactorily On the other hand, first-order logic is essentially closed: when we add new constrcts, we work in other theories or logics that inclde first-order logic, bt we go beyond it in essential ways We have already seen some examples of reasoning in first-order logic in the previos section In this section we investigate the trth of varios other propositions in order to become comfortable with first-order reasoning Jst like propositional logic, first-order logic has both classical and constrctive variants We prse the constrctive or intitionistic point of view We can recover classical trth either via an interpretation sch as Gödel s translation 1, or by adding 1 detailed in a separate note by Jeremy Avigad
2 42 First-Order Logic 65 the law of exclded middle The practical difference at the first-order level is the interpretation of the existential qantifier In classical logic, we can prove a proposition x τ A(x) tre by proving x τ A(x) tre instead Sch a proof may not yield the witness object t sch that A(t) is satisfied, which is reqired nder the constrctive interpretation of the existential qantifier Bt how is it possible to provide witnesses in pre logic, withot any assmptions abot the domain of qantifiers? The answer is that assmptions abot the existence of objects will be introdced locally dring the proof Bt we have to be carefl to verify that the objects we se to witness existential qantifiers or instantiate niversal qantifiers are indeed assmed to exist and are available at the right point in the derivation As a first concrete example, we investigate the interaction between negation and qantification We prove ( x τ A(x)) x τ A(x) tre The sbject of the jdgment above is a proposition, assming τ type and x τ A(x) prop Since all qantifiers range over the same type τ, we will omit the type label from qantification in all propositions below The reader shold keep in mind that this is merely a shorthand Frthermore, we will not explicitly state the assmption abot the propositional or predicate parameters sch as A(x) v c x A(x) c τ w E A(c) A(c) x A(x) E c,w I v x A(x) I ( x A(x)) x A(x) The two-dimensional notation for derivations becomes difficlt to manage for large proofs, so we extend the linear notation from Section 28 We se the following concrete syntax x τ A(x) x τ A(x) c τ!x:t A(x)?x:t A(x) c : t The qantifiers and act like a prefix operator with minimal binding strength, so that x τ A(x) B is the same as x τ (A(x) B) One complication introdced by existential qantification is that the elimination rle introdces two new assmptions, c τ and A(c) tre In order to
3 66 First-Order Logic and Type Theory distingish between inferred and assmed jdgments, new assmptions are separated by commas and terminated by semi-colon Under these conventions, the for rles for qantification take the following form: Introdction Elimination c : t;?x:t A(x); [c : t,?x:t A(x); ; B]; B; [c : t;!x:t A(x); ; c : t; A(c)];!x:t A(x) We se c as a new parameter to distingish parameters more clearly from bond variables Their confsion is a common sorce of error in first-order reasoning And we have the sal assmption that the name chosen for c mst be new (that is, may not occr in A(x) orb) in the existential elimination and niversal introdction rles Below we restate the proof from above in the linear notation [?x:t ~A(x); [!x:t A(x); [ c : t, ~ F ]; F ]; ~!x:t A(x) ]; (?x:t ~A(x)) => ~!x:t A(x); The opposite implication does not hold: even if we know that it is impossible that A(x) is tre for every x, this does not necessarily provide s with enogh information to obtain a witness for x A(x) In order to verify that this cannot be proven withot additional information abot A, we need to extend or notion of normal and netral proof This is straightforward only the existential elimination rle reqires some thoght It is treated in analogy with disjnction Γ,c τ A(c) I Γ x τ A(x) Γ t τ Γ A(t) I Γ x τ A(x) Γ x τ A(x) Γ A(t) Γ t τ E Γ x τ A(x) Γ,c τ, A(c) C E Γ C
4 42 First-Order Logic 67 In the case of pre first-order logic (that is, qantification is allowed only over one nknown type τ), normal proofs remain complete A correspondingly strong property fails for arithmetic, that is, when we allow the type nat This sitation is familiar from mathematics, where we often need to generalize the indction hypothesis in order to prove a theorem This generalization means that the reslting proof does not have a strong normality property We will retrn to this topic in the next section Now we retrn to showing that ( x A(x)) x A(x) tre is not derivable We search for a normal proof, which means the first step in the bottom-p constrction is forced and we are in the state x A(x) x A(x) I ( x A(x)) x A(x) At this point it is impossible to apply the existential introdction rle, becase no witness object of type τ is available So we can only apply the implication elimination rle, which leads s to the following sitation x A(x) x A(x) x A(x) E x A(x) I ( x A(x)) x A(x) Now we can either repeat the negation elimination (which leads nowhere), or se niversal introdction c x A(x) c τ A(c) I c x A(x) x A(x) E x A(x) I ( x A(x)) x A(x) The only applicable rle for constrcting normal dedctions now is again the implication elimination rle, applied to the assmption labelled This leads to
5 68 First-Order Logic and Type Theory the identical sitation, except that we have an additional assmption d τ and try to prove A(d) Clearly, we have made no progress (since the assmption c τ is now seless) Therefore the given proposition has no normal proof and hence, by the completeness of normal proofs, no proof As a second example, we see that ( x A(x)) x A(x) tre does not have a normal proof After one forced step, we have to prove x A(x) x A(x) At this point, no rle is applicable, since we cannot constrct any term of type τ Intitively, this shold make sense: if the type τ is empty, then we cannot prove x τ A(x) since we cannot provide a witness object Since we make no assmptions abot τ, τ may in fact denote an empty type (sch as 0), the above is clearly false In classical first-order logic, the assmption is often made that the domain of qantification is non-empty, in which case the implication above is tre In type theory, we can prove this implication for specific types that are known to be non-empty (sch as nat) We can also model the standard assmption that the domain is non-empty by establishing the corresponding hypothetical jdgment: c τ ( x τ A(x)) x τ A(x) We jst give this simple proof in or linear notation [ c : t; [!x:t A(x);?x:t A(x) ]; (!x:t A(x)) =>?x:t A(x)]; We can also discharge this assmption to verify that y (( x A(x)) x A(x)) tre withot any additional assmption This shows that, in general, y B is not eqivalent to B, evenify does not occr in B! While this may be conterintitive at first, the example above shows why it mst be the case The point is that while y does not occr in the proposition, it does occr in the proof and can therefore not be dropped
Draft of January 17, 1998
Linear Logic Frank Pfenning Carnegie Mellon University raft of Janary 17, 1998 Material for the corse Lineare Logik mit Anwendngen, Technische Hochschle armstadt, Sommersemester 1996 Revised for the corse
More informationAutomated Theorem Proving
Atomated Theorem Proving Frank Pfenning Carnegie Mellon University raft of Agst 23, 1999 Material for the corse Atomated Theorem Proving at Carnegie Mellon University, Fall 1999 This incldes revised versions
More informationLOGICAL FRAMEWORKS A BRIEF INTRODUCTION
LOGICAL FRAMEWORKS A BRIEF INTROUCTION FRANK PFENNING (fp+@cs.cm.ed) Carnegie Mellon University Abstract. A logical framework is a meta-langage for the formalization of dedctive systems. We provide a brief
More informationLecture Notes On THEORY OF COMPUTATION MODULE - 2 UNIT - 2
BIJU PATNAIK UNIVERSITY OF TECHNOLOGY, ODISHA Lectre Notes On THEORY OF COMPUTATION MODULE - 2 UNIT - 2 Prepared by, Dr. Sbhend Kmar Rath, BPUT, Odisha. Tring Machine- Miscellany UNIT 2 TURING MACHINE
More informationClassical and constructive logic
Classical and constrctive logic Jeremy Avigad September 19, 2000 In these notes and lectres we will discss some of the differences between classical and constrctive logic In the first few sections we will
More informationSection 7.4: Integration of Rational Functions by Partial Fractions
Section 7.4: Integration of Rational Fnctions by Partial Fractions This is abot as complicated as it gets. The Method of Partial Fractions Ecept for a few very special cases, crrently we have no way to
More information1. Tractable and Intractable Computational Problems So far in the course we have seen many problems that have polynomial-time solutions; that is, on
. Tractable and Intractable Comptational Problems So far in the corse we have seen many problems that have polynomial-time soltions; that is, on a problem instance of size n, the rnning time T (n) = O(n
More informationLecture: Corporate Income Tax
Lectre: Corporate Income Tax Ltz Krschwitz & Andreas Löffler Disconted Cash Flow, Section 2.1, Otline 2.1 Unlevered firms Similar companies Notation 2.1.1 Valation eqation 2.1.2 Weak atoregressive cash
More informationOn the tree cover number of a graph
On the tree cover nmber of a graph Chassidy Bozeman Minerva Catral Brendan Cook Oscar E. González Carolyn Reinhart Abstract Given a graph G, the tree cover nmber of the graph, denoted T (G), is the minimm
More informationWorst-case analysis of the LPT algorithm for single processor scheduling with time restrictions
OR Spectrm 06 38:53 540 DOI 0.007/s009-06-043-5 REGULAR ARTICLE Worst-case analysis of the LPT algorithm for single processor schedling with time restrictions Oliver ran Fan Chng Ron Graham Received: Janary
More informationThe Linear Quadratic Regulator
10 The Linear Qadratic Reglator 10.1 Problem formlation This chapter concerns optimal control of dynamical systems. Most of this development concerns linear models with a particlarly simple notion of optimality.
More informationCharacterizations of probability distributions via bivariate regression of record values
Metrika (2008) 68:51 64 DOI 10.1007/s00184-007-0142-7 Characterizations of probability distribtions via bivariate regression of record vales George P. Yanev M. Ahsanllah M. I. Beg Received: 4 October 2006
More informationSources of Non Stationarity in the Semivariogram
Sorces of Non Stationarity in the Semivariogram Migel A. Cba and Oy Leangthong Traditional ncertainty characterization techniqes sch as Simple Kriging or Seqential Gassian Simlation rely on stationary
More informationLecture: Corporate Income Tax - Unlevered firms
Lectre: Corporate Income Tax - Unlevered firms Ltz Krschwitz & Andreas Löffler Disconted Cash Flow, Section 2.1, Otline 2.1 Unlevered firms Similar companies Notation 2.1.1 Valation eqation 2.1.2 Weak
More informationKonyalioglu, Serpil. Konyalioglu, A.Cihan. Ipek, A.Sabri. Isik, Ahmet
The Role of Visalization Approach on Stdent s Conceptal Learning Konyaliogl, Serpil Department of Secondary Science and Mathematics Edcation, K.K. Edcation Faclty, Atatürk University, 25240- Erzrm-Trkey;
More informationCRITERIA FOR TOEPLITZ OPERATORS ON THE SPHERE. Jingbo Xia
CRITERIA FOR TOEPLITZ OPERATORS ON THE SPHERE Jingbo Xia Abstract. Let H 2 (S) be the Hardy space on the nit sphere S in C n. We show that a set of inner fnctions Λ is sfficient for the prpose of determining
More informationImprecise Continuous-Time Markov Chains
Imprecise Continos-Time Markov Chains Thomas Krak *, Jasper De Bock, and Arno Siebes t.e.krak@.nl, a.p.j.m.siebes@.nl Utrecht University, Department of Information and Compting Sciences, Princetonplein
More information1. INTRODUCTION. A solution for the dark matter mystery based on Euclidean relativity. Frédéric LASSIAILLE 2009 Page 1 14/05/2010. Frédéric LASSIAILLE
Frédéric LASSIAILLE 2009 Page 1 14/05/2010 Frédéric LASSIAILLE email: lmimi2003@hotmail.com http://lmi.chez-alice.fr/anglais A soltion for the dark matter mystery based on Eclidean relativity The stdy
More informationBLOOM S TAXONOMY. Following Bloom s Taxonomy to Assess Students
BLOOM S TAXONOMY Topic Following Bloom s Taonomy to Assess Stdents Smmary A handot for stdents to eplain Bloom s taonomy that is sed for item writing and test constrction to test stdents to see if they
More informationOn relative errors of floating-point operations: optimal bounds and applications
On relative errors of floating-point operations: optimal bonds and applications Clade-Pierre Jeannerod, Siegfried M. Rmp To cite this version: Clade-Pierre Jeannerod, Siegfried M. Rmp. On relative errors
More informationA Characterization of Interventional Distributions in Semi-Markovian Causal Models
A Characterization of Interventional Distribtions in Semi-Markovian Casal Models Jin Tian and Changsng Kang Department of Compter Science Iowa State University Ames, IA 50011 {jtian, cskang}@cs.iastate.ed
More informationA Theory of Markovian Time Inconsistent Stochastic Control in Discrete Time
A Theory of Markovian Time Inconsistent Stochastic Control in Discrete Time Tomas Björk Department of Finance, Stockholm School of Economics tomas.bjork@hhs.se Agatha Mrgoci Department of Economics Aarhs
More informationOn Multiobjective Duality For Variational Problems
The Open Operational Research Jornal, 202, 6, -8 On Mltiobjective Dality For Variational Problems. Hsain *,, Bilal Ahmad 2 and Z. Jabeen 3 Open Access Department of Mathematics, Jaypee University of Engineering
More information(Diskursrepräsentationstheorie)
(Diskrsrepräsentationstheorie) 3.1 Preliminaries 3.2 DRS Constrction After we have seen how DRT is intended to work we will have a closer look at its precise formlation. In this section we will treat the
More informationUniversal Scheme for Optimal Search and Stop
Universal Scheme for Optimal Search and Stop Sirin Nitinawarat Qalcomm Technologies, Inc. 5775 Morehose Drive San Diego, CA 92121, USA Email: sirin.nitinawarat@gmail.com Vengopal V. Veeravalli Coordinated
More informationSubcritical bifurcation to innitely many rotating waves. Arnd Scheel. Freie Universitat Berlin. Arnimallee Berlin, Germany
Sbcritical bifrcation to innitely many rotating waves Arnd Scheel Institt fr Mathematik I Freie Universitat Berlin Arnimallee 2-6 14195 Berlin, Germany 1 Abstract We consider the eqation 00 + 1 r 0 k2
More informationThe Heat Equation and the Li-Yau Harnack Inequality
The Heat Eqation and the Li-Ya Harnack Ineqality Blake Hartley VIGRE Research Paper Abstract In this paper, we develop the necessary mathematics for nderstanding the Li-Ya Harnack ineqality. We begin with
More informationOptimization via the Hamilton-Jacobi-Bellman Method: Theory and Applications
Optimization via the Hamilton-Jacobi-Bellman Method: Theory and Applications Navin Khaneja lectre notes taken by Christiane Koch Jne 24, 29 1 Variation yields a classical Hamiltonian system Sppose that
More informationOn oriented arc-coloring of subcubic graphs
On oriented arc-coloring of sbcbic graphs Alexandre Pinlo Alexandre.Pinlo@labri.fr LaBRI, Université Bordeax I, 351, Cors de la Libération, 33405 Talence, France Janary 17, 2006 Abstract. A homomorphism
More informationInformation Source Detection in the SIR Model: A Sample Path Based Approach
Information Sorce Detection in the SIR Model: A Sample Path Based Approach Kai Zh and Lei Ying School of Electrical, Compter and Energy Engineering Arizona State University Tempe, AZ, United States, 85287
More informationMath 116 First Midterm October 14, 2009
Math 116 First Midterm October 14, 9 Name: EXAM SOLUTIONS Instrctor: Section: 1. Do not open this exam ntil yo are told to do so.. This exam has 1 pages inclding this cover. There are 9 problems. Note
More informationCONTENTS. INTRODUCTION MEQ curriculum objectives for vectors (8% of year). page 2 What is a vector? What is a scalar? page 3, 4
CONTENTS INTRODUCTION MEQ crriclm objectives for vectors (8% of year). page 2 What is a vector? What is a scalar? page 3, 4 VECTOR CONCEPTS FROM GEOMETRIC AND ALGEBRAIC PERSPECTIVES page 1 Representation
More informationModelling by Differential Equations from Properties of Phenomenon to its Investigation
Modelling by Differential Eqations from Properties of Phenomenon to its Investigation V. Kleiza and O. Prvinis Kanas University of Technology, Lithania Abstract The Panevezys camps of Kanas University
More informationChords in Graphs. Department of Mathematics Texas State University-San Marcos San Marcos, TX Haidong Wu
AUSTRALASIAN JOURNAL OF COMBINATORICS Volme 32 (2005), Pages 117 124 Chords in Graphs Weizhen G Xingde Jia Department of Mathematics Texas State Uniersity-San Marcos San Marcos, TX 78666 Haidong W Department
More informationConvergence analysis of ant colony learning
Delft University of Technology Delft Center for Systems and Control Technical report 11-012 Convergence analysis of ant colony learning J van Ast R Babška and B De Schtter If yo want to cite this report
More informationKrauskopf, B., Lee, CM., & Osinga, HM. (2008). Codimension-one tangency bifurcations of global Poincaré maps of four-dimensional vector fields.
Kraskopf, B, Lee,, & Osinga, H (28) odimension-one tangency bifrcations of global Poincaré maps of for-dimensional vector fields Early version, also known as pre-print Link to pblication record in Explore
More informationBayes and Naïve Bayes Classifiers CS434
Bayes and Naïve Bayes Classifiers CS434 In this lectre 1. Review some basic probability concepts 2. Introdce a sefl probabilistic rle - Bayes rle 3. Introdce the learning algorithm based on Bayes rle (ths
More informationElements of Coordinate System Transformations
B Elements of Coordinate System Transformations Coordinate system transformation is a powerfl tool for solving many geometrical and kinematic problems that pertain to the design of gear ctting tools and
More information3.1 The Basic Two-Level Model - The Formulas
CHAPTER 3 3 THE BASIC MULTILEVEL MODEL AND EXTENSIONS In the previos Chapter we introdced a nmber of models and we cleared ot the advantages of Mltilevel Models in the analysis of hierarchically nested
More informationNewton s Laws. Why Things Move. Overview. Part
Part I Newton s Laws Overview Why Things Move Each of the seven parts of this book opens with an overview to give yo a look ahead, a glimpse at where yor jorney will take yo in the net few chapters. It
More informationThe Dual of the Maximum Likelihood Method
Department of Agricltral and Resorce Economics University of California, Davis The Dal of the Maximm Likelihood Method by Qirino Paris Working Paper No. 12-002 2012 Copyright @ 2012 by Qirino Paris All
More informationLarge Panel Test of Factor Pricing Models
Large Panel est of Factor Pricing Models Jianqing Fan, Yan Liao and Jiawei Yao Department of Operations Research and Financial Engineering, Princeton University Bendheim Center for Finance, Princeton University
More informationBIOSTATISTICAL METHODS
BIOSTATISTICAL METHOS FOR TRANSLATIONAL & CLINICAL RESEARCH ROC Crve: IAGNOSTIC MEICINE iagnostic tests have been presented as alwas having dichotomos otcomes. In some cases, the reslt of the test ma be
More informationReplacement of Einstein s Relativity Theory with a New One: Why the Second Postulate is Superfluous?
International Jornal of Physics, 16, Vol. 4, No. 5, 14-145 Available online at http://pbs.sciepb.com/ijp/4/5/5 Science and Edcation Pblishing DOI:1.1691/ijp-4-5-5 Replacement of Einstein s Relativity Theory
More informationStudy on the impulsive pressure of tank oscillating by force towards multiple degrees of freedom
EPJ Web of Conferences 80, 0034 (08) EFM 07 Stdy on the implsive pressre of tank oscillating by force towards mltiple degrees of freedom Shigeyki Hibi,* The ational Defense Academy, Department of Mechanical
More informationFailure Diagnosis of Discrete Event Systems: A Temporal Logic Approach
Failre Diagnosis of Discrete Event Systems: A Temporal Logic Approach Shengbing Jiang Electrical & Controls Integration Lab General Motors R&D 1 Otline Introdction Notion of Diagnosability in Temporal
More informationRESOLUTION OF INDECOMPOSABLE INTEGRAL FLOWS ON A SIGNED GRAPH
RESOLUTION OF INDECOMPOSABLE INTEGRAL FLOWS ON A SIGNED GRAPH BEIFANG CHEN, JUE WANG, AND THOMAS ZASLAVSKY Abstract. It is well-known that each nonnegative integral flow of a directed graph can be decomposed
More informationPulses on a Struck String
8.03 at ESG Spplemental Notes Plses on a Strck String These notes investigate specific eamples of transverse motion on a stretched string in cases where the string is at some time ndisplaced, bt with a
More informationUpper Bounds on the Spanning Ratio of Constrained Theta-Graphs
Upper Bonds on the Spanning Ratio of Constrained Theta-Graphs Prosenjit Bose and André van Renssen School of Compter Science, Carleton University, Ottaa, Canada. jit@scs.carleton.ca, andre@cg.scs.carleton.ca
More informationCubic graphs have bounded slope parameter
Cbic graphs have bonded slope parameter B. Keszegh, J. Pach, D. Pálvölgyi, and G. Tóth Agst 25, 2009 Abstract We show that every finite connected graph G with maximm degree three and with at least one
More informationConstructive Root Bound for k-ary Rational Input Numbers
Constrctive Root Bond for k-ary Rational Inpt Nmbers Sylvain Pion, Chee Yap To cite this version: Sylvain Pion, Chee Yap. Constrctive Root Bond for k-ary Rational Inpt Nmbers. 19th Annal ACM Symposim on
More informationVIBRATION MEASUREMENT UNCERTAINTY AND RELIABILITY DIAGNOSTICS RESULTS IN ROTATING SYSTEMS
VIBRATIO MEASUREMET UCERTAITY AD RELIABILITY DIAGOSTICS RESULTS I ROTATIG SYSTEMS. Introdction M. Eidkevicite, V. Volkovas anas University of Technology, Lithania The rotating machinery technical state
More information9. Tensor product and Hom
9. Tensor prodct and Hom Starting from two R-modles we can define two other R-modles, namely M R N and Hom R (M, N), that are very mch related. The defining properties of these modles are simple, bt those
More informationPropositions and Proofs
Chapter 2 Propositions and Proofs The goal of this chapter is to develop the two principal notions of logic, namely propositions and proofs There is no universal agreement about the proper foundations
More informationSecond-Order Wave Equation
Second-Order Wave Eqation A. Salih Department of Aerospace Engineering Indian Institte of Space Science and Technology, Thirvananthapram 3 December 016 1 Introdction The classical wave eqation is a second-order
More informationOn relative errors of floating-point operations: optimal bounds and applications
On relative errors of floating-point operations: optimal bonds and applications Clade-Pierre Jeannerod, Siegfried M. Rmp To cite this version: Clade-Pierre Jeannerod, Siegfried M. Rmp. On relative errors
More informationClassify by number of ports and examine the possible structures that result. Using only one-port elements, no more than two elements can be assembled.
Jnction elements in network models. Classify by nmber of ports and examine the possible strctres that reslt. Using only one-port elements, no more than two elements can be assembled. Combining two two-ports
More informationUNCERTAINTY FOCUSED STRENGTH ANALYSIS MODEL
8th International DAAAM Baltic Conference "INDUSTRIAL ENGINEERING - 19-1 April 01, Tallinn, Estonia UNCERTAINTY FOCUSED STRENGTH ANALYSIS MODEL Põdra, P. & Laaneots, R. Abstract: Strength analysis is a
More informationPhysicsAndMathsTutor.com
. Two smooth niform spheres S and T have eqal radii. The mass of S is 0. kg and the mass of T is 0.6 kg. The spheres are moving on a smooth horizontal plane and collide obliqely. Immediately before the
More informationFormules relatives aux probabilités qui dépendent de très grands nombers
Formles relatives ax probabilités qi dépendent de très grands nombers M. Poisson Comptes rends II (836) pp. 603-63 In the most important applications of the theory of probabilities, the chances of events
More informationFACULTY WORKING PAPER NO. 1081
35 51 COPY 2 FACULTY WORKING PAPER NO. 1081 Diagnostic Inference in Performance Evalation: Effects of Case and Event Covariation and Similarity Clifton Brown College of Commerce and Bsiness Administration
More informationSpanning Trees with Many Leaves in Graphs without Diamonds and Blossoms
Spanning Trees ith Many Leaes in Graphs ithot Diamonds and Blossoms Pal Bonsma Florian Zickfeld Technische Uniersität Berlin, Fachbereich Mathematik Str. des 7. Jni 36, 0623 Berlin, Germany {bonsma,zickfeld}@math.t-berlin.de
More informationThe formal denition of hyperdecidaility was drawn in [4] withot having in mind Ash's paper, in which this property is not emphasized and isolated in f
The psedovariety J is hyperdecidale J. Almeida M. Zeiton Grpo de Matematica Pra LITP { IBP Facldade de Ci^encias do Porto Universite Paris 7 P. Gomes Teixeira 4 place Jssie 4000 Porto, Portgal 75252 Paris
More informationScheduling parallel jobs to minimize the makespan
J Sched (006) 9:433 45 DOI 10.1007/s10951-006-8497-6 Schedling parallel jobs to minimize the makespan Berit Johannes C Springer Science + Bsiness Media, LLC 006 Abstract We consider the NP-hard problem
More informationSensitivity Analysis in Bayesian Networks: From Single to Multiple Parameters
Sensitivity Analysis in Bayesian Networks: From Single to Mltiple Parameters Hei Chan and Adnan Darwiche Compter Science Department University of California, Los Angeles Los Angeles, CA 90095 {hei,darwiche}@cs.cla.ed
More informationSTEP Support Programme. STEP III Hyperbolic Functions: Solutions
STEP Spport Programme STEP III Hyperbolic Fnctions: Soltions Start by sing the sbstittion t cosh x. This gives: sinh x cosh a cosh x cosh a sinh x t sinh x dt t dt t + ln t ln t + ln cosh a ln ln cosh
More informationRobust Tracking and Regulation Control of Uncertain Piecewise Linear Hybrid Systems
ISIS Tech. Rept. - 2003-005 Robst Tracking and Reglation Control of Uncertain Piecewise Linear Hybrid Systems Hai Lin Panos J. Antsaklis Department of Electrical Engineering, University of Notre Dame,
More informationCHANNEL SELECTION WITH RAYLEIGH FADING: A MULTI-ARMED BANDIT FRAMEWORK. Wassim Jouini and Christophe Moy
CHANNEL SELECTION WITH RAYLEIGH FADING: A MULTI-ARMED BANDIT FRAMEWORK Wassim Joini and Christophe Moy SUPELEC, IETR, SCEE, Avene de la Bolaie, CS 47601, 5576 Cesson Sévigné, France. INSERM U96 - IFR140-
More informationTrace-class Monte Carlo Markov Chains for Bayesian Multivariate Linear Regression with Non-Gaussian Errors
Trace-class Monte Carlo Markov Chains for Bayesian Mltivariate Linear Regression with Non-Gassian Errors Qian Qin and James P. Hobert Department of Statistics University of Florida Janary 6 Abstract Let
More informationIntegration of Basic Functions. Session 7 : 9/23 1
Integration o Basic Fnctions Session 7 : 9/3 Antiderivation Integration Deinition: Taking the antiderivative, or integral, o some nction F(), reslts in the nction () i ()F() Pt simply: i yo take the integral
More informationTOWARD THE FORMAL THEORY OF (, n)-categories
TOWRD THE FORML THEORY OF (, n)-ctegories EMILY RIEHL (JOINT WORK WITH DOMINIC VERITY) bstract. Formal category theory reers to a commonly applicable ramework (i) or deining standard categorical strctres
More informationA Model-Free Adaptive Control of Pulsed GTAW
A Model-Free Adaptive Control of Plsed GTAW F.L. Lv 1, S.B. Chen 1, and S.W. Dai 1 Institte of Welding Technology, Shanghai Jiao Tong University, Shanghai 00030, P.R. China Department of Atomatic Control,
More informationPower Enhancement in High Dimensional Cross-Sectional Tests
Power Enhancement in High Dimensional Cross-Sectional ests arxiv:30.3899v2 [stat.me] 6 Ag 204 Jianqing Fan, Yan Liao and Jiawei Yao Department of Operations Research and Financial Engineering, Princeton
More informationControl Performance Monitoring of State-Dependent Nonlinear Processes
Control Performance Monitoring of State-Dependent Nonlinear Processes Lis F. Recalde*, Hong Ye Wind Energy and Control Centre, Department of Electronic and Electrical Engineering, University of Strathclyde,
More information1. Introduction 1.1. Background and previous results. Ramanujan introduced his zeta function in 1916 [11]. Following Ramanujan, let.
IDENTITIES FOR THE RAMANUJAN ZETA FUNCTION MATHEW ROGERS Abstract. We prove formlas for special vales of the Ramanjan ta zeta fnction. Or formlas show that L(, k) is a period in the sense of Kontsevich
More informationPrandl established a universal velocity profile for flow parallel to the bed given by
EM 0--00 (Part VI) (g) The nderlayers shold be at least three thicknesses of the W 50 stone, bt never less than 0.3 m (Ahrens 98b). The thickness can be calclated sing Eqation VI-5-9 with a coefficient
More informationNonlinear parametric optimization using cylindrical algebraic decomposition
Proceedings of the 44th IEEE Conference on Decision and Control, and the Eropean Control Conference 2005 Seville, Spain, December 12-15, 2005 TC08.5 Nonlinear parametric optimization sing cylindrical algebraic
More informationCHARACTERIZATIONS OF EXPONENTIAL DISTRIBUTION VIA CONDITIONAL EXPECTATIONS OF RECORD VALUES. George P. Yanev
Pliska Std. Math. Blgar. 2 (211), 233 242 STUDIA MATHEMATICA BULGARICA CHARACTERIZATIONS OF EXPONENTIAL DISTRIBUTION VIA CONDITIONAL EXPECTATIONS OF RECORD VALUES George P. Yanev We prove that the exponential
More informationOn a class of topological groups. Key Words: topological groups, linearly topologized groups. Contents. 1 Introduction 25
Bol. Soc. Paran. Mat. (3s.) v. 24 1-2 (2006): 25 34. c SPM ISNN-00378712 On a class of topological grops Dinamérico P. Pombo Jr. abstract: A topological grop is an SNS-grop if its identity element possesses
More informationSetting The K Value And Polarization Mode Of The Delta Undulator
LCLS-TN-4- Setting The Vale And Polarization Mode Of The Delta Undlator Zachary Wolf, Heinz-Dieter Nhn SLAC September 4, 04 Abstract This note provides the details for setting the longitdinal positions
More informationSome variations on the telescope conjecture
Contemporary Mathematics Volme 00, 0000 Some variations on the telescope conjectre DOUGLAS C. RAVENEL November 29, 1993 Abstract. This paper presents some speclations abot alternatives to the recently
More informationIntroduction to Quantum Information Processing
Introdction to Qantm Information Processing Lectre 5 Richard Cleve Overview of Lectre 5 Review of some introdctory material: qantm states, operations, and simple qantm circits Commnication tasks: one qbit
More informationEssentials of optimal control theory in ECON 4140
Essentials of optimal control theory in ECON 4140 Things yo need to know (and a detail yo need not care abot). A few words abot dynamic optimization in general. Dynamic optimization can be thoght of as
More informationConditions for Approaching the Origin without Intersecting the x-axis in the Liénard Plane
Filomat 3:2 (27), 376 377 https://doi.org/.2298/fil7276a Pblished by Faclty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Conditions for Approaching
More informationFactorization systems and fibrations: Toward a fibred Birkhoff variety theorem
Factorization systems and fibrations: Toward a fibred irkhoff variety theorem Jesse Hghes and art Jacobs Department of Compter Science, Univ. of Nijmegen Toernooiveld 1, 6525 ED Nijmegen, The Netherlands
More informationPart II. Martingale measres and their constrctions 1. The \First" and the \Second" fndamental theorems show clearly how \mar tingale measres" are impo
Albert N. Shiryaev (Stelov Mathematical Institte and Moscow State University) ESSENTIALS of the ARBITRAGE THEORY Part I. Basic notions and theorems of the \Arbitrage Theory" Part II. Martingale measres
More informationIllustrations of a Modified Standard Model: Part 1-The Solar Proton- Proton Cycle
Illstrations of a Modified : Part 1-The Solar Proton- Proton Cycle by Roger N. Weller, (proton3@gmail.com), Febrary 23, 2014 Abstract A proposed modification of the, when applied to the Solar Proton-Proton
More informationRemarks on strongly convex stochastic processes
Aeqat. Math. 86 (01), 91 98 c The Athor(s) 01. This article is pblished with open access at Springerlink.com 0001-9054/1/010091-8 pblished online November 7, 01 DOI 10.1007/s00010-01-016-9 Aeqationes Mathematicae
More information8/30/17. Introduction to Deduction. Syllogisms. Syllogisms. Syllogisms. Syllogisms. Syllogisms. [a.k.a. Propositional Arguments ]
Sllogisms [a.k.a. Propositional Argments ] A Sllogism is an argment that has a set of Propositions [statements in which o propose that something is or isn t the case]. Introdction to Dedction LECTURE 4
More informationDiscrete Applied Mathematics. The induced path function, monotonicity and betweenness
Discrete Applied Mathematics 158 (2010) 426 433 Contents lists available at ScienceDirect Discrete Applied Mathematics jornal homepage: www.elsevier.com/locate/dam The indced path fnction, monotonicity
More informationA fundamental inverse problem in geosciences
A fndamental inverse problem in geosciences Predict the vales of a spatial random field (SRF) sing a set of observed vales of the same and/or other SRFs. y i L i ( ) + v, i,..., n i ( P)? L i () : linear
More informationThe Lehmer matrix and its recursive analogue
The Lehmer matrix and its recrsive analoge Emrah Kilic, Pantelimon Stănică TOBB Economics and Technology University, Mathematics Department 0660 Sogtoz, Ankara, Trkey; ekilic@etedtr Naval Postgradate School,
More informationA generalized Alon-Boppana bound and weak Ramanujan graphs
A generalized Alon-Boppana bond and weak Ramanjan graphs Fan Chng Department of Mathematics University of California, San Diego La Jolla, CA, U.S.A. fan@csd.ed Sbmitted: Feb 0, 206; Accepted: Jne 22, 206;
More informationToward a comprehensive framework for the spatiotemporal statistical analysis of longitudinal shape data
IJCV manscript No. (will be inserted by the editor) Toward a comprehensive framework for the spatiotemporal statistical analysis of longitdinal shape data S. Drrleman X. Pennec A. Trové J. Braga G. Gerig
More informationAffine Invariant Total Variation Models
Affine Invariant Total Variation Models Helen Balinsky, Alexander Balinsky Media Technologies aboratory HP aboratories Bristol HP-7-94 Jne 6, 7* Total Variation, affine restoration, Sobolev ineqality,
More informationJ.A. BURNS AND B.B. KING redced order controllers sensors/actators. The kernels of these integral representations are called fnctional gains. In [4],
Jornal of Mathematical Systems, Estimation, Control Vol. 8, No. 2, 1998, pp. 1{12 c 1998 Birkhaser-Boston A Note on the Mathematical Modelling of Damped Second Order Systems John A. Brns y Belinda B. King
More informationL 1 -smoothing for the Ornstein-Uhlenbeck semigroup
L -smoothing for the Ornstein-Uhlenbeck semigrop K. Ball, F. Barthe, W. Bednorz, K. Oleszkiewicz and P. Wolff September, 00 Abstract Given a probability density, we estimate the rate of decay of the measre
More informationReducing Conservatism in Flutterometer Predictions Using Volterra Modeling with Modal Parameter Estimation
JOURNAL OF AIRCRAFT Vol. 42, No. 4, Jly Agst 2005 Redcing Conservatism in Fltterometer Predictions Using Volterra Modeling with Modal Parameter Estimation Rick Lind and Joao Pedro Mortaga University of
More informationCommunication security: Formal models and proofs
Commnication secrity: Formal models and proofs Hbert Comon September 1, 2016 1 Introdction to protocol secrity The context (I) credit cards contactless cards telephones online transactions cars, fridges,...
More informationLINEAR COMBINATIONS AND SUBSPACES
CS131 Part II, Linear Algebra and Matrices CS131 Mathematics for Compter Scientists II Note 5 LINEAR COMBINATIONS AND SUBSPACES Linear combinations. In R 2 the vector (5, 3) can be written in the form
More information