Characterisation of Strongly Normalising λµ-terms
|
|
- Britney Campbell
- 5 years ago
- Views:
Transcription
1 Characterisation of Strongly Normalising λµ-terms Ugo de Liguoro joint work with Steffen van Bakel and Franco Barbanera ITRS - June 2012, Dubrovnik
2 Introduction Parigot s λµ-calculus is an extension of the pure λ-calculus to compute with classical proofs Parigot proved that all typeable λµ-terms (both in first and second order logic) are strongly normalizing, but the larger set of SN terms in his calculus was not considered based on the domain-theoretic model by Streicher and Reus, we have proposed an intersection type assignment system which is invariant under reduction and expansion (TLCA 11) we prove here that Pottinger s characterisation of SN λ-terms extends to λµ by suitably restricting our system
3 Parigot s λµ-calculus λµ syntax: M, N ::= x λx.m MN µα.q (terms) Q ::= [α]m (commands) Structural substitution: T[α L] the replacement of all [α]n by [α]nl in T Reduction: (β) : (λx.m)n M[N/x] (µ) : (µβ.q)n µβ.q[β N] Example (where α M, N): (µα.[α](m(µβ.[α]n)))l µα.[α](m(µβ.[α]nl)l)
4 Continuation Semantics (Streicher-Reus) Continuation domain equations R results D = [C R] denotations C = (D C) continuations If (R,D,C) are a solution then D is an extensional λ-model: D [C R] [(D C) R] [D [C R]] [D D] while C is the infinite product: C D D
5 Term Interpretation Env = (Var D) + (Name C) [[ ]] D : Trm Env D [[ ]] C : Cmd Env C [[x]] D e k = e x k [[λx.m]] D e k = [[M]] D e[x := d]k d,k = k [[MN]] D e k = [[M]] D e [[N]] D e,k [[µα.q]] D e k = d k d,k = [[Q]] C e[α := k] [[[α]m]] C e = [[M]] D e,e α where e Env, d D and k,k C.
6 Types and type inclusion L R : ρ ::= ν ρ ρ ω L C : κ ::= δ κ κ κ ω L D : δ ::= ρ κ ρ δ δ ω Some axioms for the preorders C and D (= is 1 ): ω ω = C ω, ω ω = D ω, ρ = D ω ρ Filter Domains solving Continuation Equations Let F A = Filt(L A / A ) for A = R,D,C: F D [F C F R ] and F C F D F C
7 Typing judgements Typing judgements are triples of a basis, a term/command judgement and a context: basis: Γ = {x 1 : δ 1,...,x n : δ n }, with x i Var, δ i L D judgement: term: M : δ with M Trm, δ L D command: Q : κ with Q Cmd, κ L C context: = {α 1 : κ 1,..., α m : κ m }, with α i Name, κ i L C A typing judgement has either forms: Γ M : δ or Γ Q : κ
8 The full type assignment system (TLCA 11) (Var) Γ,x : δ x : δ Γ,x : δ M : κ ρ ( I) Γ λx.m : δ κ ρ Γ M : δ α : κ, ( ) Γ [α]m : δ κ α : κ, Γ M : δ κ ρ Γ N : δ ( E) Γ MN : κ ρ Γ Q : (κ ρ) κ α : κ, (µ) Γ µα.q : κ ρ (ω) Γ M : ω Γ M : δ Γ M : δ ( ) Γ M : δ δ Γ M : δ Γ M : δ δ δ ( )
9 Pottinger s Theorem Theorem (Pottinger) A λ-term M is strongly normalisable if and only if there exist Γ,σ such that Γ M : σ is derivable in an intersection type system without the type ω. Can we get rid of ω in the system for λµ? Of course we have to abandon rule: (ω) Γ M : ω but what about the types?
10 The meaning of ω The type κ = δ 1 δ k ω L C is semantically inhabited by any infinite tuple: d 1,...,d k,d k+1,... C such that d i [[δ i ]] D for i = 1,...,k. We then restrict the occurrences of ω to the end of a product type κ and add the axiom: δ 1 δ 2 ω δ 1 ω By eliminating rule (ω) the meaning of ω changes: lack of information partial information about a total object
11 The computability interpretation of types L ω R L ω C L ω D : ρ ::= ν ρ ρ ω : κ ::= δ ω δ κ κ κ ω : δ ::= ρ ω ρ κ ρ δ δ ω
12 The computability interpretation of types L ω R L ω C L ω D : ρ ::= ν ρ ρ : κ ::= δ ω δ κ κ κ : δ ::= ρ ω ρ κ ρ δ δ A stack is a tuple L 1 :: :: L k for some k N. SN is the set of stacks of terms in SN. [[ω ρ]] = [[ρ]] = SN [[κ ρ]] = {M Trm L [[κ]]. M L [[ρ]]} [[δ ω]] = {N :: L N [[δ]], L SN } [[δ κ]] = {N :: L N [[δ]], L [[κ]]} [[σ τ]] = [[σ]] [[τ]] where L is a vector or a stack according to the context.
13 Types are saturated sets Properties of the computability interpretation of types: [[δ]] SN and [[κ]] SN for δ L ω D and κ L ω C M[N/x] L [[δ]] & N [[δ ]] (λx.m)n L [[δ]] (µα[α](m[α N]N)) L [[δ]] (µα[α]m)n L [[δ]] (µα[β](m[α N])) L [[δ]] & N [[δ ]] (µα[β]m)n L [[δ]] if α β σ τ [[σ]] [[τ]]
14 Typing judgements for commands are problematic Toward soundness, for ξ (Var Trm) + (Name Trm ) we set: M ξ = M [ξ(x 1 )/x 1,...,ξ(x h )/x h,[α 1 ξ(α 1 )],...,[α k ξ(α k )]] We expect that if ξ(x) [[Γ(x)]] and ξ(α) [[ (α)]] for all x dom(γ) and α dom( ) then: Γ M : δ M ξ [[δ]] How should we interpret a statement like [α]m : κ? Γ M : δ α : κ, ( ) Γ [α]m : δ κ α : κ, Γ Q : (κ ρ) κ α : κ, (µ) Γ µα.q : κ ρ
15 First solution: two derived rules We replace the rules: Γ M : δ α : κ, ( ) Γ [α]m : δ κ α : κ, Γ Q : (κ ρ) κ α : κ, (µ) Γ µα.q : κ ρ by the admissible rules: Γ M : κ ρ α : κ, (µ1 ) Γ µα.[α]m : κ ρ Γ M : κ ρ α : κ,β : κ, (µ2 ) Γ µα.[β]m : κ ρ β : κ,
16 First solution: the restricted system with (µ 1 ) and (µ 2 ) (Var) Γ,x : δ x : δ Γ,x : δ M : κ ρ ( I) Γ λx.m : δ κ ρ Γ M : κ ρ α : κ, (µ 1) Γ µα.[α]m : κ ρ Γ M : δ κ ρ Γ N : δ ( E) Γ MN : κ ρ Γ M : κ ρ α : κ, β : κ, (µ 2) Γ µα.[β]m : κ ρ β : κ, Γ M : δ Γ M : δ ( ) Γ M : δ δ Γ M : δ Γ M : δ δ δ ( ) where types are in L ω = L ω R L ω D L ω C and is restricted to L ω.
17 Second solution: distinct interpretation of judgments For ξ (Var Trm) + (Name Trm ) we set ξ = Γ, iff x dom(γ), α dom( ). ξ(x) [[Γ(x)]] & ξ(α) [[ (α)]] hence we define: Γ = M : δ ξ. ξ = Γ, M ξ [[δ]] Γ = [α]m : κ ξ. ξ = Γ, M ξ :: ξ(α) [[κ]] where N :: L is just the stack obtained by pushing N in front of L and recall that M ξ = M [ξ(x 1 )/x 1,...,ξ(x h )/x h,[α 1 ξ(α 1 )],...,[α k ξ(α k )]]
18 Second solution: the restricted system with ( ) and (µ) (Var) Γ,x : δ x : δ Γ,x : δ M : κ ρ ( I) Γ λx.m : δ κ ρ Γ M : δ α : κ, ( ) Γ [α]m : δ κ α : κ, Γ M : δ κ ρ Γ N : δ ( E) Γ MN : κ ρ Γ Q : (κ ρ) κ α : κ, (µ) Γ µα.q : κ ρ Γ M : δ Γ M : δ ( ) Γ M : δ δ Γ M : δ Γ M : δ δ δ ( ) where types are in L ω = L ω R L ω D L ω C and is restricted to L ω.
19 The characterisation theorem Theorem: soundness 1 Γ ω M : δ Γ = M : δ 2 Γ ω Q : κ Γ = Q : κ Therefore if Γ ω M : δ then M SN. Proof. By simultaneous induction on derivation. Finally take ξ 0 s.t. ξ 0 (x) = x and ξ 0 (α) = y. If Γ ω M : δ then: ξ 0 = Γ, so that M ξ0 [[δ]] SN M ξ0 SN M SN Theorem: completeness If M SN then Γ ω M : δ for some Γ,δ and. Proof. Similar to the proof for the λ-calculus.
20 Final remarks we have a type characterisation of SN-terms of λµ-calculus, that should extend smoothly to De Groote-Saurin variant, and also to Fellaisen s λc-calculus we plan to compare the present proof with Berger s semantic proof of strong normalisation for extended λ-calculi we think that intersection type machinery can be used to obtain elegant analysis of continuations as well as of other non functional aspects of extended λ-calculi, often studied by means of e.g. effect systems
A Translation of Intersection and Union Types
A Translation of Intersection and Union Types for the λ µ-calculus Kentaro Kikuchi RIEC, Tohoku University kentaro@nue.riec.tohoku.ac.jp Takafumi Sakurai Department of Mathematics and Informatics, Chiba
More informationCharacterisation of Strongly Normalising λµ-terms
Characterisation of Strongly Normalising λµ-terms Steffen van Bakel Imperial College London London, UK svb@doc.ic.ac.uk Franco Barbanera Università di Catania Catania, Italy barba@dmi.unict.it Ugo de Liguoro
More informationSemantic Types for Classes and Mixins
University of Turin ITRS 14, Vienna, July 18, 2014 Motivations Motivations Issues: Mixins have been proposed in the late 80 s to enhance modularity and reusability of code for class based OO programming
More informationAN ESTIMATION FOR THE LENGTHS OF REDUCTION SEQUENCES
Logical Methods in Computer Science Vol. 14(2:17)2018, pp. 1 35 https://lmcs.episciences.org/ Submitted Mar. 20, 2017 Published Jun. 22, 2018 AN ESTIMATION FOR THE LENGTHS OF REDUCTION SEQUENCES OF THE
More informationCS792 Notes Henkin Models, Soundness and Completeness
CS792 Notes Henkin Models, Soundness and Completeness Arranged by Alexandra Stefan March 24, 2005 These notes are a summary of chapters 4.5.1-4.5.5 from [1]. 1 Review indexed family of sets: A s, where
More informationHow not to prove Strong Normalisation
How not to prove Strong Normalisation based on joint work with James Chapman School of Computer Science and IT University of Nottingham April 11, 2007 Long time ago... 1993 A formalization of the strong
More informationTwo Notions of Sub-behaviour for Session-based Client/Server Systems
Two Notions of Sub-behaviour for Session-based Client/Server Systems Franco Barbanera 1 and Ugo de Liguoro 2 1 Dipartimento di Matematica e Informatica, Università di Catania 2 Dipartimento di Informatica,
More informationDevelopment Separation in Lambda-Calculus
Development Separation in Lambda-Calculus Hongwei Xi Boston University Work partly funded by NSF grant CCR-0229480 Development Separation in Lambda-Calculus p.1/26 Motivation for the Research To facilitate
More informationIntroduction to Type Theory August 2007 Types Summer School Bertinoro, It. Herman Geuvers Nijmegen NL. Lecture 3: Polymorphic λ-calculus
Introduction to Type Theory August 2007 Types Summer School Bertinoro, It Herman Geuvers Nijmegen NL Lecture 3: Polymorphic λ-calculus 1 Why Polymorphic λ-calculus? Simple type theory λ is not very expressive
More informationBrief Notes on the Category Theoretic Semantics of Simply Typed Lambda Calculus
University of Cambridge 2017 MPhil ACS / CST Part III Category Theory and Logic (L108) Brief Notes on the Category Theoretic Semantics of Simply Typed Lambda Calculus Andrew Pitts Notation: comma-separated
More informationFull Abstraction for Nominal General References
Full bstraction for Nominal General References Overview This talk is about formulating a fully-abstract semantics of nominal general references using nominal games. Nominal Sets Full bstraction for Nominal
More informationTHE NUMBER OF UNARY CLONES CONTAINING THE PERMUTATIONS ON AN INFINITE SET
THE NUMBER OF UNARY CLONES CONTAINING THE PERMUTATIONS ON AN INFINITE SET MICHAEL PINSKER Abstract. We calculate the number of unary clones (submonoids of the full transformation monoid) containing the
More informationCHOICE THEORY, UTILITY FUNCTIONS AND RISK AVERSION
CHOICE THEORY, UTILITY FUNCTIONS AND RISK AVERSION Szabolcs Sebestyén szabolcs.sebestyen@iscte.pt Master in Finance INVESTMENTS Sebestyén (ISCTE-IUL) Choice Theory Investments 1 / 65 Outline 1 An Introduction
More informationUnary PCF is Decidable
Unary PCF is Decidable Ralph Loader Merton College, Oxford November 1995, revised October 1996 and September 1997. Abstract We show that unary PCF, a very small fragment of Plotkin s PCF [?], has a decidable
More informationDevelopment Separation in Lambda-Calculus
WoLLIC 2005 Preliminary Version Development Separation in Lambda-Calculus Hongwei Xi 1,2 Computer Science Department Boston University Boston, Massachusetts, USA Abstract We present a proof technique in
More informationSilver type theorems for collapses.
Silver type theorems for collapses. Moti Gitik May 19, 2014 The classical theorem of Silver states that GCH cannot break for the first time over a singular cardinal of uncountable cofinality. On the other
More informationStrong normalisation and the typed lambda calculus
CHAPTER 9 Strong normalisation and the typed lambda calculus In the previous chapter we looked at some reduction rules for intuitionistic natural deduction proofs and we have seen that by applying these
More informationThe Semi-Weak Square Principle
The Semi-Weak Square Principle Maxwell Levine Universität Wien Kurt Gödel Research Center for Mathematical Logic Währinger Straße 25 1090 Wien Austria maxwell.levine@univie.ac.at Abstract Cummings, Foreman,
More informationChapter 4. Cardinal Arithmetic.
Chapter 4. Cardinal Arithmetic. 4.1. Basic notions about cardinals. We are used to comparing the size of sets by seeing if there is an injection from one to the other, or a bijection between the two. Definition.
More informationUPWARD STABILITY TRANSFER FOR TAME ABSTRACT ELEMENTARY CLASSES
UPWARD STABILITY TRANSFER FOR TAME ABSTRACT ELEMENTARY CLASSES JOHN BALDWIN, DAVID KUEKER, AND MONICA VANDIEREN Abstract. Grossberg and VanDieren have started a program to develop a stability theory for
More informationCharacterising Strong Normalisation for Explicit Substitutions
Characterising Strong Normalisation for Explicit Substitutions (LATIN 02, Cancun, Mexico, LNCS 2286, pp. 356-370, 2002) Steffen van Bakel 1 and Mariangiola Dezani-Ciancaglini 2 1 Department of Computing,
More informationTHE OPERATIONAL PERSPECTIVE
THE OPERATIONAL PERSPECTIVE Solomon Feferman ******** Advances in Proof Theory In honor of Gerhard Jäger s 60th birthday Bern, Dec. 13-14, 2013 1 Operationally Based Axiomatic Programs The Explicit Mathematics
More informationδ j 1 (S j S j 1 ) (2.3) j=1
Chapter The Binomial Model Let S be some tradable asset with prices and let S k = St k ), k = 0, 1,,....1) H = HS 0, S 1,..., S N 1, S N ).) be some option payoff with start date t 0 and end date or maturity
More informationInterpolation of κ-compactness and PCF
Comment.Math.Univ.Carolin. 50,2(2009) 315 320 315 Interpolation of κ-compactness and PCF István Juhász, Zoltán Szentmiklóssy Abstract. We call a topological space κ-compact if every subset of size κ has
More informationExtender based forcings, fresh sets and Aronszajn trees
Extender based forcings, fresh sets and Aronszajn trees Moti Gitik August 31, 2011 Abstract Extender based forcings are studied with respect of adding branches to Aronszajn trees. We construct a model
More informationTABLEAU-BASED DECISION PROCEDURES FOR HYBRID LOGIC
TABLEAU-BASED DECISION PROCEDURES FOR HYBRID LOGIC THOMAS BOLANDER AND TORBEN BRAÜNER Abstract. Hybrid logics are a principled generalization of both modal logics and description logics. It is well-known
More informationMITCHELL S THEOREM REVISITED. Contents
MITCHELL S THEOREM REVISITED THOMAS GILTON AND JOHN KRUEGER Abstract. Mitchell s theorem on the approachability ideal states that it is consistent relative to a greatly Mahlo cardinal that there is no
More information0.1 Equivalence between Natural Deduction and Axiomatic Systems
0.1 Equivalence between Natural Deduction and Axiomatic Systems Theorem 0.1.1. Γ ND P iff Γ AS P ( ) it is enough to prove that all axioms are theorems in ND, as MP corresponds to ( e). ( ) by induction
More informationPhilipp Moritz Lücke
Σ 1 -partition properties Philipp Moritz Lücke Mathematisches Institut Rheinische Friedrich-Wilhelms-Universität Bonn http://www.math.uni-bonn.de/people/pluecke/ Logic & Set Theory Seminar Bristol, 14.02.2017
More informationÉcole normale supérieure, MPRI, M2 Year 2007/2008. Course 2-6 Abstract interpretation: application to verification and static analysis P.
École normale supérieure, MPRI, M2 Year 2007/2008 Course 2-6 Abstract interpretation: application to verification and static analysis P. Cousot Questions and answers of the partial exam of Friday November
More informationAUTOSUBST: Automation for de Bruijn Substitutions
AUTOSUBST: Automation for de Bruijn Substitutions https://www.ps.uni-saarland.de/autosubst Steven Schäfer Tobias Tebbi Gert Smolka Department of Computer Science Saarland University, Germany August 13,
More informationThe (λ, κ)-fn and the order theory of bases in boolean algebras
The (λ, κ)-fn and the order theory of bases in boolean algebras David Milovich Texas A&M International University david.milovich@tamiu.edu http://www.tamiu.edu/ dmilovich/ June 2, 2010 BLAST 1 / 22 The
More informationStrongly compact Magidor forcing.
Strongly compact Magidor forcing. Moti Gitik June 25, 2014 Abstract We present a strongly compact version of the Supercompact Magidor forcing ([3]). A variation of it is used to show that the following
More informationShort Extenders Forcings II
Short Extenders Forcings II Moti Gitik July 24, 2013 Abstract A model with otp(pcf(a)) = ω 1 + 1 is constructed, for countable set a of regular cardinals. 1 Preliminary Settings Let κ α α < ω 1 be an an
More informationGeneralising the weak compactness of ω
Generalising the weak compactness of ω Andrew Brooke-Taylor Generalised Baire Spaces Masterclass Royal Netherlands Academy of Arts and Sciences 22 August 2018 Andrew Brooke-Taylor Generalising the weak
More information2 Deduction in Sentential Logic
2 Deduction in Sentential Logic Though we have not yet introduced any formal notion of deductions (i.e., of derivations or proofs), we can easily give a formal method for showing that formulas are tautologies:
More informationThe rth moment of a real-valued random variable X with density f(x) is. x r f(x) dx
1 Cumulants 1.1 Definition The rth moment of a real-valued random variable X with density f(x) is µ r = E(X r ) = x r f(x) dx for integer r = 0, 1,.... The value is assumed to be finite. Provided that
More informationMonadic translation of sequent calculus for classical logic
Monadic translation of sequent calculus for classical logic Luís Pinto 1 Univ. Minho Braga, Portugal Theory Seminar at Inst. of Cybernetics Tallinn, Estonia 2 December 2010 1 Joint work with José Espírito
More informationPERFECT TREE FORCINGS FOR SINGULAR CARDINALS
PERFECT TREE FORCINGS FOR SINGULAR CARDINALS NATASHA DOBRINEN, DAN HATHAWAY, AND KAREL PRIKRY Abstract. We investigate forcing properties of perfect tree forcings defined by Prikry to answer a question
More informationarxiv: v1 [math.lo] 27 Mar 2009
arxiv:0903.4691v1 [math.lo] 27 Mar 2009 COMBINATORIAL AND MODEL-THEORETICAL PRINCIPLES RELATED TO REGULARITY OF ULTRAFILTERS AND COMPACTNESS OF TOPOLOGICAL SPACES. V. PAOLO LIPPARINI Abstract. We generalize
More informationLecture IV Portfolio management: Efficient portfolios. Introduction to Finance Mathematics Fall Financial mathematics
Lecture IV Portfolio management: Efficient portfolios. Introduction to Finance Mathematics Fall 2014 Reduce the risk, one asset Let us warm up by doing an exercise. We consider an investment with σ 1 =
More informationIntersection-Types à la Church
Intersection-Types à la Church Luigi Liquori INRIA Sophia Antipolis, France Simona Ronchi Della Rocca Dipartimento di Informatica, Università di Torino, Italy Abstract In this paper, we present Λ t, a
More informationarxiv:math/ v1 [math.lo] 9 Dec 2006
arxiv:math/0612246v1 [math.lo] 9 Dec 2006 THE NONSTATIONARY IDEAL ON P κ (λ) FOR λ SINGULAR Pierre MATET and Saharon SHELAH Abstract Let κ be a regular uncountable cardinal and λ > κ a singular strong
More informationbeing saturated Lemma 0.2 Suppose V = L[E]. Every Woodin cardinal is Woodin with.
On NS ω1 being saturated Ralf Schindler 1 Institut für Mathematische Logik und Grundlagenforschung, Universität Münster Einsteinstr. 62, 48149 Münster, Germany Definition 0.1 Let δ be a cardinal. We say
More informationGUESSING MODELS IMPLY THE SINGULAR CARDINAL HYPOTHESIS arxiv: v1 [math.lo] 25 Mar 2019
GUESSING MODELS IMPLY THE SINGULAR CARDINAL HYPOTHESIS arxiv:1903.10476v1 [math.lo] 25 Mar 2019 Abstract. In this article we prove three main theorems: (1) guessing models are internally unbounded, (2)
More informationLogic and Artificial Intelligence Lecture 24
Logic and Artificial Intelligence Lecture 24 Eric Pacuit Currently Visiting the Center for Formal Epistemology, CMU Center for Logic and Philosophy of Science Tilburg University ai.stanford.edu/ epacuit
More informationRetractable and Speculative Contracts
Retractable and Speculative Contracts Ivan Lanese Computer Science Department University of Bologna/INRIA Italy Joint work with Franco Barbanera and Ugo de'liguoro Map of the talk What retractable/speculative
More informationCardinal arithmetic: The Silver and Galvin-Hajnal Theorems
B. Zwetsloot Cardinal arithmetic: The Silver and Galvin-Hajnal Theorems Bachelor thesis 22 June 2018 Thesis supervisor: dr. K.P. Hart Leiden University Mathematical Institute Contents Introduction 1 1
More informationMatching [for] the Lambda Calculus of Objects
Matching [for] the Lambda Calculus of Objects Viviana Bono 1 Dipartimento di Informatica, Università di Torino C.so Svizzera 185, I-10149 Torino, Italy e-mail: bono@di.unito.it Michele Bugliesi Dipartimento
More informationStability in geometric & functional inequalities
Stability in geometric & functional inequalities A. Figalli The University of Texas at Austin www.ma.utexas.edu/users/figalli/ Alessio Figalli (UT Austin) Stability in geom. & funct. ineq. Krakow, July
More informationHod up to AD R + Θ is measurable
Hod up to AD R + Θ is measurable Rachid Atmai Department of Mathematics University of North Texas General Academics Building 435 1155 Union Circle #311430 Denton, TX 76203-5017 atmai.rachid@gmail.com Grigor
More informationFORCING AND THE HALPERN-LÄUCHLI THEOREM. 1. Introduction This document is a continuation of [1]. It is intended to be part of a larger paper.
FORCING AND THE HALPERN-LÄUCHLI THEOREM NATASHA DOBRINEN AND DAN HATHAWAY Abstract. We will show the various effects that forcing has on the Halpern-Läuchli Theorem. We will show that the the theorem at
More informationCOMBINATORICS OF REDUCTIONS BETWEEN EQUIVALENCE RELATIONS
COMBINATORICS OF REDUCTIONS BETWEEN EQUIVALENCE RELATIONS DAN HATHAWAY AND SCOTT SCHNEIDER Abstract. We discuss combinatorial conditions for the existence of various types of reductions between equivalence
More information}w!"#$%&'()+,-./012345<ya FI MU. A Calculus of Coercive Subtyping. Faculty of Informatics Masaryk University Brno
}w!"#$%&'()+,-./012345
More informationNon replication of options
Non replication of options Christos Kountzakis, Ioannis A Polyrakis and Foivos Xanthos June 30, 2008 Abstract In this paper we study the scarcity of replication of options in the two period model of financial
More informationStock Loan Valuation Under Brownian-Motion Based and Markov Chain Stock Models
Stock Loan Valuation Under Brownian-Motion Based and Markov Chain Stock Models David Prager 1 1 Associate Professor of Mathematics Anderson University (SC) Based on joint work with Professor Qing Zhang,
More informationOn almost precipitous ideals.
On almost precipitous ideals. Asaf Ferber and Moti Gitik December 20, 2009 Abstract With less than 0 # two generic extensions of L are identified: one in which ℵ 1, and the other ℵ 2, is almost precipitous.
More informationGödel algebras free over finite distributive lattices
TANCL, Oxford, August 4-9, 2007 1 Gödel algebras free over finite distributive lattices Stefano Aguzzoli Brunella Gerla Vincenzo Marra D.S.I. D.I.COM. D.I.C.O. University of Milano University of Insubria
More informationThe tree property for supercompactness
(Joint work with Matteo Viale) June 6, 2010 Recall that κ is weakly compact κ is inaccessible + κ-tp holds, where κ-tp is the tree property on κ. Due to Mitchell and Silver we have V = κ is weakly compact
More informationarxiv:math/ v1 [math.lo] 15 Jan 1991
ON A CONJECTURE OF TARSKI ON PRODUCTS OF CARDINALS arxiv:math/9201247v1 [mathlo] 15 Jan 1991 Thomas Jech 1 and Saharon Shelah 2 Abstract 3 We look at an old conjecture of A Tarski on cardinal arithmetic
More informationA semantics for concurrent permission logic. Stephen Brookes CMU
A semantics for concurrent permission logic Stephen Brookes CMU Cambridge, March 2006 Traditional logic Owicki/Gries 76 Γ {p} c {q} Resource-sensitive partial correctness Γ specifies resources ri, protection
More informationContinuous images of closed sets in generalized Baire spaces ESI Workshop: Forcing and Large Cardinals
Continuous images of closed sets in generalized Baire spaces ESI Workshop: Forcing and Large Cardinals Philipp Moritz Lücke (joint work with Philipp Schlicht) Mathematisches Institut, Rheinische Friedrich-Wilhelms-Universität
More informationADDING A LOT OF COHEN REALS BY ADDING A FEW II. 1. Introduction
ADDING A LOT OF COHEN REALS BY ADDING A FEW II MOTI GITIK AND MOHAMMAD GOLSHANI Abstract. We study pairs (V, V 1 ), V V 1, of models of ZF C such that adding κ many Cohen reals over V 1 adds λ many Cohen
More informationAdditional questions for chapter 3
Additional questions for chapter 3 1. Let ξ 1, ξ 2,... be independent and identically distributed with φθ) = IEexp{θξ 1 })
More informationLevel by Level Inequivalence, Strong Compactness, and GCH
Level by Level Inequivalence, Strong Compactness, and GCH Arthur W. Apter Department of Mathematics Baruch College of CUNY New York, New York 10010 USA and The CUNY Graduate Center, Mathematics 365 Fifth
More informationALL LARGE-CARDINAL AXIOMS NOT KNOWN TO BE INCONSISTENT WITH ZFC ARE JUSTIFIED arxiv: v3 [math.lo] 30 Dec 2017
ALL LARGE-CARDINAL AXIOMS NOT KNOWN TO BE INCONSISTENT WITH ZFC ARE JUSTIFIED arxiv:1712.08138v3 [math.lo] 30 Dec 2017 RUPERT M c CALLUM Abstract. In other work we have outlined how, building on ideas
More informationEXTENSIVE AND NORMAL FORM GAMES
EXTENSIVE AND NORMAL FORM GAMES Jörgen Weibull February 9, 2010 1 Extensive-form games Kuhn (1950,1953), Selten (1975), Kreps and Wilson (1982), Weibull (2004) Definition 1.1 A finite extensive-form game
More informationOrthogonality to the value group is the same as generic stability in C-minimal expansions of ACVF
Orthogonality to the value group is the same as generic stability in C-minimal expansions of ACVF Will Johnson February 18, 2014 1 Introduction Let T be some C-minimal expansion of ACVF. Let U be the monster
More informationCut-free sequent calculi for algebras with adjoint modalities
Cut-free sequent calculi for algebras with adjoint modalities Roy Dyckhoff (University of St Andrews) and Mehrnoosh Sadrzadeh (Universities of Oxford & Southampton) TANCL Conference, Oxford, 8 August 2007
More informationHints on Some of the Exercises
Hints on Some of the Exercises of the book R. Seydel: Tools for Computational Finance. Springer, 00/004/006/009/01. Preparatory Remarks: Some of the hints suggest ideas that may simplify solving the exercises
More informationModel-independent bounds for Asian options
Model-independent bounds for Asian options A dynamic programming approach Alexander M. G. Cox 1 Sigrid Källblad 2 1 University of Bath 2 CMAP, École Polytechnique University of Michigan, 2nd December,
More informationSTRONGLY UNFOLDABLE CARDINALS MADE INDESTRUCTIBLE
The Journal of Symbolic Logic Volume 73, Number 4, Dec. 2008 STRONGLY UNFOLDABLE CARDINALS MADE INDESTRUCTIBLE THOMAS A. JOHNSTONE Abstract. I provide indestructibility results for large cardinals consistent
More informationOutline Introduction Game Representations Reductions Solution Concepts. Game Theory. Enrico Franchi. May 19, 2010
May 19, 2010 1 Introduction Scope of Agent preferences Utility Functions 2 Game Representations Example: Game-1 Extended Form Strategic Form Equivalences 3 Reductions Best Response Domination 4 Solution
More informationSy D. Friedman. August 28, 2001
0 # and Inner Models Sy D. Friedman August 28, 2001 In this paper we examine the cardinal structure of inner models that satisfy GCH but do not contain 0 #. We show, assuming that 0 # exists, that such
More informationOn the Splitting Number at Regular Cardinals
On the Splitting Number at Regular Cardinals Omer Ben-Neria and Moti Gitik January 25, 2014 Abstract Let κ,λ be regular uncountable cardinals such that κ + < λ. We construct a generic extension with s(κ)
More informationEstimating a Dynamic Oligopolistic Game with Serially Correlated Unobserved Production Costs. SS223B-Empirical IO
Estimating a Dynamic Oligopolistic Game with Serially Correlated Unobserved Production Costs SS223B-Empirical IO Motivation There have been substantial recent developments in the empirical literature on
More information1 Dynamic programming
1 Dynamic programming A country has just discovered a natural resource which yields an income per period R measured in terms of traded goods. The cost of exploitation is negligible. The government wants
More informationTwo Stationary Sets with Different Gaps of the Power Function
Two Stationary Sets with Different Gaps of the Power Function Moti Gitik School of Mathematical Sciences Tel Aviv University Tel Aviv 69978, Israel gitik@post.tau.ac.il August 14, 2014 Abstract Starting
More informationProgramming Languages
CSE 230: Winter 2010 Principles of Programming Languages Lecture 3: Induction, Equivalence Ranjit Jhala UC San Diego Operational Semantics of IMP Evaluation judgement for commands Ternary relation on expression,
More informationExponential utility maximization under partial information
Exponential utility maximization under partial information Marina Santacroce Politecnico di Torino Joint work with M. Mania AMaMeF 5-1 May, 28 Pitesti, May 1th, 28 Outline Expected utility maximization
More informationComprehensive Exam. August 19, 2013
Comprehensive Exam August 19, 2013 You have a total of 180 minutes to complete the exam. If a question seems ambiguous, state why, sharpen it up and answer the sharpened-up question. Good luck! 1 1 Menu
More informationUntyped Lambda Calculus
Chapter 2 Untyped Lambda Calculus We assume the existence of a denumerable set VAR of (object) variables x 0,x 1,x 2,..., and use x,y,z to range over these variables. Given two variables x 1 and x 2, we
More informationSHORT EXTENDER FORCING
SHORT EXTENDER FORCING MOTI GITIK AND SPENCER UNGER 1. Introduction These notes are based on a lecture given by Moti Gitik at the Appalachian Set Theory workshop on April 3, 2010. Spencer Unger was the
More informationMatching of Meta-Expressions with Recursive Bindings
Matching of Meta-Expressions with Recursive Bindings David Sabel Goethe-University Frankfurt am Main, Germany UNIF 2017, Oxford, UK Research supported by the Deutsche Forschungsgemeinschaft (DFG) under
More informationBuilding Infinite Processes from Regular Conditional Probability Distributions
Chapter 3 Building Infinite Processes from Regular Conditional Probability Distributions Section 3.1 introduces the notion of a probability kernel, which is a useful way of systematizing and extending
More informationAMH4 - ADVANCED OPTION PRICING. Contents
AMH4 - ADVANCED OPTION PRICING ANDREW TULLOCH Contents 1. Theory of Option Pricing 2 2. Black-Scholes PDE Method 4 3. Martingale method 4 4. Monte Carlo methods 5 4.1. Method of antithetic variances 5
More information3 The Model Existence Theorem
3 The Model Existence Theorem Although we don t have compactness or a useful Completeness Theorem, Henkinstyle arguments can still be used in some contexts to build models. In this section we describe
More informationCIS 500 Software Foundations Fall October. CIS 500, 6 October 1
CIS 500 Software Foundations Fall 2004 6 October CIS 500, 6 October 1 Midterm 1 is next Wednesday Today s lecture will not be covered by the midterm. Next Monday, review class. Old exams and review questions
More informationTechniques for Calculating the Efficient Frontier
Techniques for Calculating the Efficient Frontier Weerachart Kilenthong RIPED, UTCC c Kilenthong 2017 Tee (Riped) Introduction 1 / 43 Two Fund Theorem The Two-Fund Theorem states that we can reach any
More informationA Model of Financial Intermediation
A Model of Financial Intermediation Jesús Fernández-Villaverde University of Pennsylvania December 25, 2012 Jesús Fernández-Villaverde (PENN) A Model of Financial Intermediation December 25, 2012 1 / 43
More informationMathematics in Finance
Mathematics in Finance Steven E. Shreve Department of Mathematical Sciences Carnegie Mellon University Pittsburgh, PA 15213 USA shreve@andrew.cmu.edu A Talk in the Series Probability in Science and Industry
More informationA relation on 132-avoiding permutation patterns
Discrete Mathematics and Theoretical Computer Science DMTCS vol. VOL, 205, 285 302 A relation on 32-avoiding permutation patterns Natalie Aisbett School of Mathematics and Statistics, University of Sydney,
More informationModel-independent bounds for Asian options
Model-independent bounds for Asian options A dynamic programming approach Alexander M. G. Cox 1 Sigrid Källblad 2 1 University of Bath 2 CMAP, École Polytechnique 7th General AMaMeF and Swissquote Conference
More information5 Deduction in First-Order Logic
5 Deduction in First-Order Logic The system FOL C. Let C be a set of constant symbols. FOL C is a system of deduction for the language L # C. Axioms: The following are axioms of FOL C. (1) All tautologies.
More informationCharacterizing large cardinals in terms of layered partial orders
Characterizing large cardinals in terms of layered partial orders Philipp Moritz Lücke Joint work with Sean D. Cox (VCU Richmond) Mathematisches Institut Rheinische Friedrich-Wilhelms-Universität Bonn
More informationFinancial Economics 4: Portfolio Theory
Financial Economics 4: Portfolio Theory Stefano Lovo HEC, Paris What is a portfolio? Definition A portfolio is an amount of money invested in a number of financial assets. Example Portfolio A is worth
More informationTall, Strong, and Strongly Compact Cardinals
Tall, Strong, and Strongly Compact Cardinals Arthur W. Apter Department of Mathematics Baruch College of CUNY New York, New York 10010 USA and The CUNY Graduate Center, Mathematics 365 Fifth Avenue New
More informationComparing Goal-Oriented and Procedural Service Orchestration
Comparing Goal-Oriented and Procedural Service Orchestration M. Birna van Riemsdijk 1 Martin Wirsing 2 1 Technische Universiteit Delft, The Netherlands m.b.vanriemsdijk@tudelft.nl 2 Ludwig-Maximilians-Universität
More informationA HIERARCHY OF RAMSEY-LIKE CARDINALS
A HIERARCHY OF RAMSEY-LIKE CARDINALS PETER HOLY AND PHILIPP SCHLICHT Abstract. We introduce a hierarchy of large cardinals between weakly compact and measurable cardinals, that is closely related to the
More informationRiemannian Geometry, Key to Homework #1
Riemannian Geometry Key to Homework # Let σu v sin u cos v sin u sin v cos u < u < π < v < π be a parametrization of the unit sphere S {x y z R 3 x + y + z } Fix an angle < θ < π and consider the parallel
More information