Search
Search Funnelback University
Bed & breakfast in Cambridge Colleges
Bed and breakfast accommodation in University of Cambridge Colleges out of term time.
https://www.Universityrooms.com/en-GB/city/cambridge/home- Refined by:
- Date: Past 3 months
61 -
110 of
728
search results for b&b
Fully-matching results
-
Theory Dlist
https://www.cl.cam.ac.uk/research/hvg/Isabelle/dist/library/HOL/HOL-Library/Dlist.html23 May 2024: definition length :: "'awhere "length dxsdxs)" qualified definition fold :: "('a 'b 'b) 'a dlist 'b 'b" where "fold f dxsf (list_of_dlist dxs)" qualified definition foldr :: "('a 'b 'b) 'a dlist ... b 'b" where "foldr f dxsf (list_of_dlist dxs)" end -
Theory HOL-Library.Multiset
https://www.cl.cam.ac.uk/research/hvg/Isabelle/dist/library/HOL/HOL-Analysis/HOL-Library.Multiset.html23 May 2024: simp lemma set_mset_empty [simp]: "by (simp add: set_mset_def) lemma set_mset_single: "set_mset {#b#} = {b}" by (simp add: set_mset_def) lemma ... Mx A" by (where x = "Mx#}"]) simp lemma multiset_add_sub_el_shuffle: assumes "c # B" and "b c" shows -
Theory SList
https://www.cl.cam.ac.uk/research/hvg/Isabelle/dist/library/HOL/HOL-Induct/SList.html23 May 2024: c)(Split(d))" definition List_rec :: "['a item, 'b, ['a item, 'a item, 'b]=>'b] => 'b" where "List_rec M c dg. ... ML ) list_rec :: "['a list, 'b, ['a, 'a list, 'b]=>'b] => 'b" where "list_rec l c dl) c (%x y r. -
Theory Completion
https://www.cl.cam.ac.uk/research/hvg/Isabelle/dist/library/HOL/HOLCF/Completion.html23 May 2024: iff: "principal a = principal b a b b a" unfolding po_eq_conv [where 'a='b] principal_below_iff. ... principal a = Abs {b. b a}" assumes countable: "f::'af" shows "ideal_completion r principal Rep" proof interpret type_definition Rep Abs "{S. -
Theory Cooper
https://www.cl.cam.ac.uk/research/hvg/Isabelle/dist/library/HOL/HOL-Decision_Procs/Cooper.html23 May 2024: assumes "bound0 p" shows "Ifm bbs (b # bs) pbbs (b' # bs) p" usingwhere b="b" and bs="bs" and b'="b'"] by (induct p rule:simp add: gr0_conv_Suc) fun ... I': "numbound0 a Inum (b#bs) (numsubst0 a t)b'#bs) a)#bs) t" by (induct t rule:simp:where b="b" and b' -
Theory HOL.Presburger
https://www.cl.cam.ac.uk/research/hvg/Isabelle/dist/library/HOL/HOL-Proofs/HOL.Presburger.html23 May 2024: bB. x b j) (x = t) (x - D = t))" "⟦Dt B⟧ ((x::jD}. ... bB. x b j) (x t) (x - D t))" "⟦Dt B⟧ ((x::jD}. -
Theory Groups
https://www.cl.cam.ac.uk/research/hvg/Isabelle/dist/library/HOL/HOL/Groups.html23 May 2024: locale semigroup = fixes f :: "'a 'a 'a" (infixl "" 70) assumes assoc [ac_simps]: "a b c = a (b c)" locale abel_semigroup = semigroup assumes commute [ac_simps]: "a b = b a" ... standard (fact add_assoc) declareend hide_fact add_assoc class -
Theory Groups_List
https://www.cl.cam.ac.uk/research/hvg/Isabelle/dist/library/HOL/HOL/Groups_List.html23 May 2024: ASCII) "_sum_list" :: "pttrn => 'a list => 'b => 'b" ("(3SUM _<-_. _)" [0, 51, 10] 10) syntax "_sum_list" :: "pttrn => 'a list => 'b => 'b" ("(3__. _)" ... b" ("(3PROD _<-_. _)" [0, 51, 10] 10) syntax "_prod_list" :: "pttrn => 'a list => 'b => 'b" ("(3__. -
Theory Group_Action
https://www.cl.cam.ac.uk/research/hvg/Isabelle/dist/library/HOL/HOL-Algebra/Group_Action.html23 May 2024: assumes group_hom: "group_hom G (BijGroup E) φ" definition orbit :: "[_, 'a 'b 'b, 'b] 'b set" where "orbit G φ x = {(φ g) x | g. ... x E}" definition stabilizer :: "[_, 'a 'b 'b, 'b] 'a set" where "stabilizer G φ x = {g carrier G. ( -
Theory Err
https://www.cl.cam.ac.uk/research/hvg/Isabelle/dist/library/HOL/HOL-MicroJava/Err.html23 May 2024: A a u B b) apply (case_tac "A = B") apply simp apply simp apply (apply clarify apply (rename_tac A a u B b) apply (case_tac "A = B") apply ... rotate_tac -1) apply simp apply (rotate_tac -1) apply (case_tac "B = C") apply simp apply (rotate_tac -1) apply -
Theory HOL.Wellfounded
https://www.cl.cam.ac.uk/research/hvg/Isabelle/dist/library/HOL/HOL-Proofs/HOL.Wellfounded.html23 May 2024: lemma wf_onI_pf: assumes "B. B A B R B Bshows "wf_on A R" unfolding wf_on_def proof (introfix P :: "'a bool" and x :: 'a let? ... a 'a) set ('b 'b) set (('a 'b) ('a 'b)) set" (infixr "<lex>" 80) where "ra <lex> rb = {((a, b), (a', b')). -
Theory HOL-Algebra.Congruence
https://www.cl.cam.ac.uk/research/hvg/Isabelle/dist/library/HOL/HOL-Homology/HOL-Algebra.Congruence.html23 May 2024: a. a A - b! b'. b' B - {b} a b'" using unique_class by fastforce next show "b'. ... b' B - {b} b' A - b" usingby fastforce qed lemma disjoint_sum: ‹contributor ‹Paulo Emílio de Vilhena›› "⟦ finite B; finite A; partition A B⟧ (bB. -
Theory Order
https://www.cl.cam.ac.uk/research/hvg/Isabelle/dist/library/HOL/HOL-Algebra/Order.html23 May 2024: and "a b" "b a" shows "P" using assms by (elimlemma (in weak_partial_order) lless_trans [trans]: assumes "a b" "b c" and carr[simp]: "aL" "bL" "cL" shows "a ... add:subsubsection ‹Idempotent functions› definition idempotent :: "('a, 'b) gorder_scheme -
Theory HOL-Library.Equipollence
https://www.cl.cam.ac.uk/research/hvg/Isabelle/dist/library/HOL/HOL-Analysis/HOL-Library.Equipollence.html23 May 2024: B; u A; v B⟧ A B" by (lemma insert_lepoll_cong: assumes "A B" "b B" shows "insert a Ab B" proof - obtain f where f: "inj_on f A" ... where "inj_on f A" "f A B" using assms by (then obtain b where b: "b B" "b f A" by auto show? -
Theory FuncSet
https://www.cl.cam.ac.uk/research/hvg/Isabelle/dist/library/HOL/HOL-Library/FuncSet.html23 May 2024: mk_disjoint_insert by fastforce lemma fst_Pi: "A B A" and snd_Pi: "A B B" by auto subsection ‹Composition With a Restricted Domain: <term>‹compose›› lemma funcset_compose: "f ... E. x{a}. B x) = (b B a. {λx {a}. b})" apply (auto simp: PiE_iff -
Theory Matrix
https://www.cl.cam.ac.uk/research/hvg/Isabelle/dist/library/HOL/HOL-Matrix_LP/Matrix.html23 May 2024: f aa" definition zero_l_neutral :: "('a::zero 'b 'b) bool" where "zero_l_neutral f == a. ... fmul fadd A B" by simp qed definition r_distributive :: "('a 'b 'b) ('b 'b 'b) bool" where "r_distributive fmul fadd == a u v. -
Theory Perm
https://www.cl.cam.ac.uk/research/hvg/Isabelle/dist/library/HOL/HOL-Combinatorics/Perm.html23 May 2024: f b b}" by auto interpret bijection f by‹bij f›) from fin show "f)a. ... f b b}" then have "bij f" by simp interpret bijection f by‹bij f›) show "{a. -
Theory Misc_Datatype
https://www.cl.cam.ac.uk/research/hvg/Isabelle/dist/library/HOL/HOL-Datatype_Examples/Misc_Datatype.html23 May 2024: b1 'a 'b2 ('a, 'b1, 'b2) F2 = unit 'b1 'b2 ) locale loc = fixes c :: 'a and d :: 'a assumes "c d" begin datatype (discs_sels) 'b I1 = I11 'b "'b I1" | ... I12 'b "'b I2" and 'b I2 = I21 | I22 "'b I1" "'b I2" datatype (discs_sels) 'b tree = TEmpty | TNode -
Theory Log_Nat
https://www.cl.cam.ac.uk/research/hvg/Isabelle/dist/library/HOL/HOL-Library/Log_Nat.html23 May 2024: b xb (x / b b)" using that by simp also have "…b (x / b)b b" using that by (also have "…b (x / b)using that by simp also have "b ... x / b)b (x div b (x / b - x div b))" by simp also have "…b (x div b)" usingby (introfinally show? -
Theory HOL.HOL
https://www.cl.cam.ac.uk/research/hvg/Isabelle/dist/library/HOL/HOL-Proofs/HOL.HOL.html23 May 2024: Pz = x) (Pz = y))" definition Let :: "'a ('a 'b) 'b" where "Let s f f s" translations "_Let (_binds b bs) e" "_Let b (_Let bs e)" "let x = a in ... lemma not_sym: "t s s t" by (erule contrapos_nn) (erule sym) lemma eq_neq_eq_imp_neq: "⟦x = a; a b; b = -
Theory Weierstrass_Theorems
https://www.cl.cam.ac.uk/research/hvg/Isabelle/dist/library/HOL/HOL-Analysis/Weierstrass_Theorems.html23 May 2024: a - b)x = a (ax2 b) a x b b x" by (simp add:have "(kn. ... norm(f x - g x) < e)" proof - { fix b :: 'b assume "bhave "pp (x S. -
Theory Borel_Space
https://www.cl.cam.ac.uk/research/hvg/Isabelle/dist/library/HOL/HOL-Analysis/Borel_Space.html23 May 2024: k K open k" unfolding eq by auto from ex_countable_basis obtain B :: "'awhere B: "b. ... fix X::"'a set" assume "open X" from open_countable_basisE[OF this] obtain B' where B': "B' B" "XB'". -
Theory DAList_Multiset
https://www.cl.cam.ac.uk/research/hvg/Isabelle/dist/library/HOL/HOL-Library/DAList_Multiset.html23 May 2024: thesis unfolding mset_less_eq_Bag0 by auto qed declare inter_mset_def [code] declare union_mset_def [code] declare mset.simps [code] fun fold_impl :: "('a nat 'b 'b) 'b ... ab" where "fold_impl fn e ((a,n) # ms) = (fold_impl fn ((fn a n) e) ms)" | -
Theory Set_Algebras
https://www.cl.cam.ac.uk/research/hvg/Isabelle/dist/library/HOL/HOL-Library/Set_Algebras.html23 May 2024: auto simp add: set_plus_def) lemma set_plus_elim: assumes "x A B" obtains a b where "x = a b" and "a A" and "b B" using assms unfolding ... b" and "a A" and "b B" using assms unfolding set_times_def by fast lemma set_times_intro2 [intro!]: "b C a b a o C" -
Theory ArithSimp
https://www.cl.cam.ac.uk/research/hvg/Isabelle/dist/library/FOL/ZF/ArithSimp.html23 May 2024: nm#k))" by (auto intro: less_imp_succ_add) lemma add_lt_elim2: "⟦a # d = b # c; a < b; bcd⟧ c < d" by (drulelemma add_le_elim2: "⟦a # d = b # c; ... add:lemma raw_nat_diff_split: "⟦ab⟧ (P(a #- b)) ((a < b P(dnat. -
Theory Rat_Pair
https://www.cl.cam.ac.uk/research/hvg/Isabelle/dist/library/HOL/HOL-Decision_Procs/Rat_Pair.html23 May 2024: g = "gcd (a b' b a') (b b')" have gz: "?gusing False by simp show? ... g = "gcd (a a') (b b')" have gz: "?gusing neq by simp fromwhere? -
Theory Sum
https://www.cl.cam.ac.uk/research/hvg/Isabelle/dist/library/FOL/ZF/Sum.html23 May 2024: bool: "C) = C(C(1)" by (unfoldIntroduction rules for the injections ) lemma InlI [intro!,simp,TC]: "a A Inl(a) AB" by (unfoldlemma InrI [intro!,simp,TC]: "b B Inr(b) ... b): AB b B" by blast lemma sum_iff: "u ABx. -
Theory Giry_Monad
https://www.cl.cam.ac.uk/research/hvg/Isabelle/dist/library/HOL/HOL-Probability/Giry_Monad.html23 May 2024: h xa.b} g (h x) = x" assumes range: "{a.bh" shows "f) lborel h) {a.bλx. ... where B=B])(auto simp add: f_bounded) then show "enn2real (. - f x M') = x. f x M'" by(simp add: real_lebesgue_integral_def) qed qed simp_all finally show? -
Theory Num
https://www.cl.cam.ac.uk/research/hvg/Isabelle/dist/library/HOL/HOL/Num.html23 May 2024: syntax begin lemma transfer_rule_numeral: ‹(R)› if [transfer_rule]: ‹R› ‹R› ‹(R ===> R ===> R)› for R :: ‹'a::{b::{› proof - have "(R) (λk. ... b)k) 0)› using numeral_add_unfold_funpow [where? 'a = 'b, of _ 0] by (simp add: -
Theory Traces
https://www.cl.cam.ac.uk/research/hvg/Isabelle/dist/library/HOL/IOA/Traces.html23 May 2024: a, 's2)where "fair_implements C ACACACA" lemma implements_trans: "A =<| B B =<| C A =<| C" by (auto simp add: ioa_implements_def) subsection ‹Modules› subsubsection ‹Execution, schedule and trace modules› ... mk_trace›› (alternative -
Theory Limits
https://www.cl.cam.ac.uk/research/hvg/Isabelle/dist/library/HOL/HOL/Limits.html23 May 2024: f x - g x) a - b) F" using tendsto_add [of f a F "λx. - ... norm (x y)xy K" using nonneg_bounded by blast obtain B where B: "B" and norm_g: "eventually (λx. -
Theory Cardinal_Order_Relation
https://www.cl.cam.ac.uk/research/hvg/Isabelle/dist/library/HOL/HOL-Cardinals/Cardinal_Order_Relation.html23 May 2024: a. f aa A) ( a A. case f a of Some b b B |None True)}" lemma card_of_Func_option_Func: "A BA B|" proof (unfold card_of_ordIso[symmetric], ... case f a of None True | Some b b B)}" lemma Func_Pfunc: "Func_option A BA B" unfoldingby auto lemma -
3 The Formalism of Quantum Mechanics In the previous ...
www.damtp.cam.ac.uk/user/tong/qm/qm3.pdf26 Jun 2024: Typically AB is not the same as BA. The commutator [A, B] captures. ... the dierence between these. Clearly [A, B] = [B, A] and the same also holds foroperators: [Ô, M̂] = [M̂, Ô]. -
Theory Peano_Axioms
https://www.cl.cam.ac.uk/research/hvg/Isabelle/dist/library/HOL/HOL-ex/Peano_Axioms.html23 May 2024: b) 'a 'b bool" for e :: 'b and r :: "'a 'b 'b" where Rec_zero: "Rec e r zero e" | Rec_succ: "Rec e r m n Rec e r (succ ... by (simp only:) qed qed qed text ‹ The recursion operator -- polymorphic!› definition rec :: "'b ('a 'b 'b) 'a 'b" where "rec e -
Theory Guard_Yahalom
https://www.cl.cam.ac.uk/research/hvg/Isabelle/dist/library/HOL/HOL-Auth/Guard_Yahalom.html23 May 2024: uniq_in_ya2'_parts [rule_format]: "⟦evsBB'⟧ Ciph B ⦃Agent A, Nonce NA, Nonce NB⦄evs)B' ⦃Agent A', Nonce NA', Nonce NB⦄evs) A=A' B=B' NA=NA'" apply ... simp) lemma NB_is_uniq_in_ya2': "⟦ya2' C A B NA NBevs; ya2' C' A' B' NA' NBevs; evsBB'⟧ -
Theory Further_Topology
https://www.cl.cam.ac.uk/research/hvg/Isabelle/dist/library/HOL/HOL-Analysis/Further_Topology.html23 May 2024: x A" | A B where "x D" "A face_of B" "B " "B 𝒢" "aff_dim AT" "x A" using x by (auto simp: _def) then have xrel: "xD" proof cases ... b" using bounded_subset_cbox_symmetric by blast define bbox where "bboxbbhave "b) b bbox" by (auto simp:intro!: -
Theory Sum_Type
https://www.cl.cam.ac.uk/research/hvg/Isabelle/dist/library/HOL/HOL/Sum_Type.html23 May 2024: a 'bwhere "Inr_Rep b x y p y = bp" definition "sum = {f. ... A <> BAB" hide_const (open) Plus ― ‹Valuable identifier› lemma InlI [intro!]: "a A Inl a A <> B" by (simp add: Plus_def) lemma InrI [intro!]: "b B Inr b A <> B" -
Theory Sym_Groups
https://www.cl.cam.ac.uk/research/hvg/Isabelle/dist/library/HOL/HOL-Algebra/Sym_Groups.html23 May 2024: Theory Sym_Groups. ( Title: HOL/Algebra/Sym_Groups.thy Author: Paulo Emílio de Vilhena ) theory Sym_Groups imports "begin section ‹Symmetric Groups› subsection ‹Definitions› abbreviation inv' :: "('a 'b) ('b 'a)" where ... by auto obtain a b c -
Theory Product_Topology
https://www.cl.cam.ac.uk/research/hvg/Isabelle/dist/library/HOL/HOL-Analysis/Product_Topology.html23 May 2024: X Y) T'" for T' proof (clarsimp; intro conjI) fix a :: "'a" and b :: "'b" assume "(a, b) T'" with that obtain U V where UV: "openin X U" "openin Y ... AX) BY)}" if "finite T" "T 𝒳 𝒴" for T using that proof induction case (insert B ) then show? -
Theory Polynomials
https://www.cl.cam.ac.uk/research/hvg/Isabelle/dist/library/HOL/HOL-Algebra/Polynomials.html23 May 2024: 𝟬)" by (induction n) (auto) lemma scalar_coeff: "aRλb. a b) p) = (λi. ... a_p2 = "(map (λb. a b) p2)a # p1)) 𝟬)" have "a # p1))λ_. -
Theory Guard_NS_Public
https://www.cl.cam.ac.uk/research/hvg/Isabelle/dist/library/HOL/HOL-Auth/Guard_NS_Public.html23 May 2024: B (B) ⦃Nonce NA, Agent A⦄)" abbreviation (input) ns1' :: "where "ns1' A' A B NA == Says A' B (B) ⦃Nonce NA, Agent A⦄)" abbreviation (input) ns2 :: "where "ns2 B A NA ... NB == Says B A (A) ⦃Nonce NA, Nonce NB, Agent B⦄)" abbreviation (input) -
Theory SchorrWaite
https://www.cl.cam.ac.uk/research/hvg/Isabelle/dist/library/HOL/HOL-Hoare/SchorrWaite.html23 May 2024: B b RB" apply blast done lemma oneStep_reachable: "b RB b RB" apply blast done lemma still_reachable: "⟦BRaA; (x,y) Rb-Ra. ... x R m x x reachable? Rb? B›.› let? T = "{t, p.r}" have "?RaA? -
Theory BNF_Def
https://www.cl.cam.ac.uk/research/hvg/Isabelle/dist/library/HOL/HOL/BNF_Def.html23 May 2024: a A}" definition "Grp A f = (λa b. b = f a a A)" definition vimage2p where "vimage2p f g R = (λx y. ... y, x)) AR)" by auto lemma predicate2_eqD: "A = B A a b B a b" by simp lemma case_sum_o_inj: "case_sum f gf" "case_sum f gg" -
Theory WF
https://www.cl.cam.ac.uk/research/hvg/Isabelle/dist/library/FOL/ZF/WF.html23 May 2024: y,x⟩: r y B) x B A<=B›› lemma wf_onI2: assumes prem: "y B. ... well-founded induction then we have <term>‹wf(r)›.› lemma wfI: "⟦field(r)<=A; y B. -
Theory Weak_Morphisms
https://www.cl.cam.ac.uk/research/hvg/Isabelle/dist/library/HOL/HOL-Algebra/Weak_Morphisms.html23 May 2024: scheme A and show the existence of an isomorphism between A and B. ... f b = f a } H #> a" proof fix b assume b: "b { b carrier G. -
https://poetics.english.cam.ac.uk/tag/thomasz-bak/feed/
https://poetics.english.cam.ac.uk/tag/thomasz-bak/feed/4 Jun 2024: p style="text-align: left;"b[beep]Generation–the new Polish Poets, /b/p p style="text-align: left;"Monday 10th February, 2020, 18.00–19.30/p p ... Wilson Drama Studio, Faculty of English, 9 West Road, Cambridge CB3 9DP/p p /p p style="text-align: left -
Theory Main
https://www.cl.cam.ac.uk/research/hvg/Isabelle/dist/library/HOL/HOL/Main.html23 May 2024: inf (infixl "" 70) and sup (infixl "" 65) and Inf (" _" [900] 900) and Sup (" _" [900] 900) syntax "_INF1" :: "pttrns 'b 'b" ("(3_./ _)" [0, 10] 10) "_INF" :: "pttrn 'a set 'b 'b" ("(3__./ _)" ... 0, 0, 10] 10) "_SUP1" :: "pttrns 'b 'b" ("(3_./ _)" [0, 10 -
STATISTICAL MODELLING Part IIC, Michaelmas 2021Practical 2: More on…
www.statslab.cam.ac.uk/~qz280/teaching/modelling-2022/P2.pdf3 Jun 2024: Thus for large B we can expect to see thatFB(x) F(x). ... B <- length(f_stat). theoretical_quantiles <- qf((1:B) / (B 1), df1, df2). -
Theory Set
https://www.cl.cam.ac.uk/research/hvg/Isabelle/dist/library/HOL/HOL/Set.html23 May 2024: subset: "A = B A B B A" by blast lemma subset_iff: "A Bt. ... vimageI [intro]: "f a = b b B a f - B" unfolding vimage_def by blast lemma vimageI2: "f a A a f - A" unfolding vimage_def by fast lemma vimageE [elim!]: -
Theory Orderings
https://www.cl.cam.ac.uk/research/hvg/Isabelle/dist/library/HOL/HOL/Orderings.html23 May 2024: thesis. qed lemma order_less_subst1: "(a::'a::f b (b::'b::c (!x y. x < y f x < f y) a < f c" proof - assume r: "!x y. ... thesis. qed lemma order_subst1: "(a::'a::f b (b::'b::c (!x y. x <= y f x <= f y) a <= f c" proof - assume r: "!x y.
Search history
Recently clicked results
Recently clicked results
Your click history is empty.
Recent searches
Recent searches
Your search history is empty.