Ursula Martin : Publications

[1]
Modelling the Way Mathematics Is Actually Done
Joseph Corneli‚ Ursula Martin‚ Dave Murray−Rust‚ Alison Pease‚ Raymond Puzio and Gabriela Rino Nesin
2017.
Details about Modelling the Way Mathematics Is Actually Done  BibTeX data for Modelling the Way Mathematics Is Actually Done

[2]
The early mathematical education of Ada Lovelace
Christopher Hollings‚ Ursula Martin and Adrian Rice
In BSHM Bulletin: Journal of the British Society for the History of Mathematics. Pages 1–14. 2017.
Details about The early mathematical education of Ada Lovelace  BibTeX data for The early mathematical education of Ada Lovelace

[3]
The Lovelace–De Morgan mathematical correspondence: A critical re−appraisal
Christopher Hollings‚ Ursula Martin and Adrian Rice
In Historia Mathematica. 2017.
Details about The Lovelace–De Morgan mathematical correspondence: A critical re−appraisal  BibTeX data for The Lovelace–De Morgan mathematical correspondence: A critical re−appraisal

[4]
Slightly dirty maths: The richly textured mechanisms of impact
Laura R Meagher and Ursula Martin
In Research Evaluation. Vol. 26. No. 1. Pages 15–27. 2017.
Details about Slightly dirty maths: The richly textured mechanisms of impact  BibTeX data for Slightly dirty maths: The richly textured mechanisms of impact

[5]
Towards mathematical AI via a model of the content and process of mathematical question and answer dialogues
Joseph Corneli‚ Ursula Martin‚ Dave Murray−Rust and Alison Pease
In International Conference on Intelligent Computer Mathematics. Pages 132–146. Springer‚ Cham. 2017.
Details about Towards mathematical AI via a model of the content and process of mathematical question and answer dialogues  BibTeX data for Towards mathematical AI via a model of the content and process of mathematical question and answer dialogues

[6]
Bootstrapping the next generation of mathematical social machines
Ursula Martin‚ Alison Pease and Joseph Corneli
In Off the Beaten Track Workshop at POPL‚ UPMC Paris. Vol. 21. 2017.
Details about Bootstrapping the next generation of mathematical social machines  BibTeX data for Bootstrapping the next generation of mathematical social machines

[7]
ADA Lovelace Computer Scientist
Ursula Martin
In ITNOW. Vol. 57. No. 4. Pages 54–55. 2015.
Details about ADA Lovelace Computer Scientist  BibTeX data for ADA Lovelace Computer Scientist

[8]
Ada Lovelace‚ mathematician
U Martin
In Mathematics Today. Vol. 51. No. 6 (December). Pages 254–255. 2015.
Details about Ada Lovelace‚ mathematician  BibTeX data for Ada Lovelace‚ mathematician

[9]
Ada Lovelace‚ a scientist in the archives
Soren Riis‚ Ursula Martin and Nick Woodhouse
In Ada Lovelace Symposium 2015−Celebrating 200 Years of a Computer Visionary. Pages 14. ACM. 2015.
Details about Ada Lovelace‚ a scientist in the archives  BibTeX data for Ada Lovelace‚ a scientist in the archives

[10]
Stumbling Around in the Dark: Lessons from Everyday Mathematics
Ursula Martin
In International Conference on Automated Deduction. Pages 29–51. Springer International Publishing. 2015.
Details about Stumbling Around in the Dark: Lessons from Everyday Mathematics  BibTeX data for Stumbling Around in the Dark: Lessons from Everyday Mathematics

[11]
Thinking Saltmarshes
Ursula Martin
In Brain vs. Machine Human Ideas on the Age of Intelligent Machines.. Harper Perennial. 2015.
Details about Thinking Saltmarshes  BibTeX data for Thinking Saltmarshes

[12]
Hardy‚ Littlewood and polymath
Ursula Martin and Alison Pease
In Mathematics‚ Substance and Surmise. Pages 9–23. Springer International Publishing. 2015.
Details about Hardy‚ Littlewood and polymath  BibTeX data for Hardy‚ Littlewood and polymath

[13]
Computational logic and the social
Ursula Martin
In Journal of Logic and Computation. Vol. 26. No. 2. Pages 467–477. 2014.
Details about Computational logic and the social  BibTeX data for Computational logic and the social

[14]
Opportunities and Challenges in 21st Century Mathematical Computation: ICERM Workshop Report
David H Bailey‚ Jonathan M Borwein‚ Olga Caprotti‚ Ursula Martin‚ Bruno Salvy and Michela Taufer
2014.
Details about Opportunities and Challenges in 21st Century Mathematical Computation: ICERM Workshop Report  BibTeX data for Opportunities and Challenges in 21st Century Mathematical Computation: ICERM Workshop Report

[15]
Opportunities and challenges in 21st century experimental mathematical computation: ICERM workshop report
David H Bailey‚ Jonathan M Borwein‚ Ursula Martin‚ Bruno Salvy and Michela Taufer
In URL http://www. davidhbailey. com/dhbpapers/ICERM−2014. pdf (visited on 10/19/2014). 2014.
Details about Opportunities and challenges in 21st century experimental mathematical computation: ICERM workshop report  BibTeX data for Opportunities and challenges in 21st century experimental mathematical computation: ICERM workshop report

[16]
Close Observation And Description
Ursula Martin
In What Should We Be Worried About? Real Scenarios That Keep Scientists Up at Night.. Harper Perennial‚. 2014.
Details about Close Observation And Description  BibTeX data for Close Observation And Description

[17]
Applications of real number theorem proving in PVS
Ursula Martin and others
In Formal Asp. Comput.. Vol. 25. No. 6. 2013.
Details about Applications of real number theorem proving in PVS  BibTeX data for Applications of real number theorem proving in PVS

[18]
What does mathoverflow tell us about the production of mathematics?
Ursula Martin and Alison Pease
In arXiv preprint arXiv:1305.0904. 2013.
Details about What does mathoverflow tell us about the production of mathematics?  BibTeX data for What does mathoverflow tell us about the production of mathematics?

[19]
What does mathoverflow tell us about the production of mathematics?
Ursula Martin and Alison Pease
In CoRR. Vol. abs/1305.0904. 2013.
Details about What does mathoverflow tell us about the production of mathematics?  BibTeX data for What does mathoverflow tell us about the production of mathematics?

[20]
Applications of real number theorem proving in PVS
Hanne Gottliebsen‚ Ruth Hardy‚ Olga Lightfoot and Ursula Martin
In Formal Asp. Comput.. Vol. 25. No. 6. Pages 993−1016. 2013.
Details about Applications of real number theorem proving in PVS  BibTeX data for Applications of real number theorem proving in PVS

[21]
A Hoare logic for linear systems
Rob Arthan‚ Ursula Martin and Paulo Oliva
In Formal Aspects of Computing. Vol. 25. No. 3. Pages 345–363. 2013.
Details about A Hoare logic for linear systems  BibTeX data for A Hoare logic for linear systems

[22]
Mathematical practice‚ crowdsourcing‚ and social machines
Ursula Martin and Alison Pease
In International Conference on Intelligent Computer Mathematics. Pages 98–119. Springer‚ Berlin‚ Heidelberg. 2013.
Details about Mathematical practice‚ crowdsourcing‚ and social machines  BibTeX data for Mathematical practice‚ crowdsourcing‚ and social machines

[23]
Mathematical Practice‚ Crowdsourcing‚ and Social Machines
Ursula Martin and Alison Pease
In Jacques Carette‚ David Aspinall‚ Christoph Lange‚ Petr Sojka and Wolfgang Windsteiger, editors, Intelligent Computer Mathematics − MKM‚ Calculemus‚ DML‚ and Systems and Projects 2013‚ Held as Part of CICM 2013‚ Bath‚ UK‚ July 8−12‚ 2013. Proceedings. Vol. 7961 of Lecture Notes in Computer Science. Pages 98−119. 2013.
Details about Mathematical Practice‚ Crowdsourcing‚ and Social Machines  BibTeX data for Mathematical Practice‚ Crowdsourcing‚ and Social Machines

[24]
Applications of real number theorem proving in PVS
Hanne Gottliebsen‚ Ruth Hardy‚ Olga Lightfoot and Ursula Martin
In Formal Aspects of Computing. Pages On–line. 2012.
Details about Applications of real number theorem proving in PVS  BibTeX data for Applications of real number theorem proving in PVS

[25]
1377 questions and counting–what can we learn from online math
Ursula Martin and Alison Pease
In Dagstuhl Seminar. Pages 1–6. 2012.
Details about 1377 questions and counting–what can we learn from online math  BibTeX data for 1377 questions and counting–what can we learn from online math

[26]
Computers‚ Reasoning and Mathematical
Ursula Martin
In Computational Logic. Vol. 165. Pages 301. Springer Science & Business Media. 2012.
Details about Computers‚ Reasoning and Mathematical  BibTeX data for Computers‚ Reasoning and Mathematical

[27]
Seventy four minutes of mathematics: An analysis of the third Mini−Polymath project
Alison Pease and Ursula Martin
In Proceedings of AISB/IACAP 2012‚ Symposium on Mathematical Practice and Cognition II. Pages 52–105. 2012.
Details about Seventy four minutes of mathematics: An analysis of the third Mini−Polymath project  BibTeX data for Seventy four minutes of mathematics: An analysis of the third Mini−Polymath project

[28]
A general framework for sound and complete Floyd−Hoare logics
Rob Arthan‚ Ursula Martin‚ Erik A Mathiesen and Paulo Oliva
In ACM Transactions on Computational Logic (TOCL). Vol. 11. No. 1. Pages 7. 2009.
Details about A general framework for sound and complete Floyd−Hoare logics  BibTeX data for A general framework for sound and complete Floyd−Hoare logics

[29]
The automorphism group of a finite p−group is almost always a p−group
Geir T Helleloid and Ursula Martin
In Journal of Algebra. Vol. 312. No. 1. Pages 294–329. 2007.
Details about The automorphism group of a finite p−group is almost always a p−group  BibTeX data for The automorphism group of a finite p−group is almost always a p−group

[30]
Reasoning about linear systems
Rob Arthan‚ Ursula Martin‚ Erik Arne Mathiesen and Paulo Oliva
In Proceedings of 5th IEEE International Conference on Software Engineering and Formal Methods SEFM. 2007.
Details about Reasoning about linear systems  BibTeX data for Reasoning about linear systems

[31]
Almost All p−Groups Have Automorphism Group a p−Group When p is Odd
Geir T Helleloid and Ursula Martin
In arXiv preprint math/0602039. 2006.
Details about Almost All p−Groups Have Automorphism Group a p−Group When p is Odd  BibTeX data for Almost All p−Groups Have Automorphism Group a p−Group When p is Odd

[32]
Hoare logic in the abstract
Ursula Martin‚ Erik A Mathiesen and Paulo Oliva
In International Workshop on Computer Science Logic. Pages 501–515. Springer‚ Berlin‚ Heidelberg. 2006.
Details about Hoare logic in the abstract  BibTeX data for Hoare logic in the abstract

[33]
Hidden verification for computational mathematics
Ursula Martin and others
In J. Symb. Comput.. Vol. 39. No. 5. 2005.
Details about Hidden verification for computational mathematics  BibTeX data for Hidden verification for computational mathematics

[34]
Panelist position statement: logic and models in computer science
Ursula Martin
In Philosophical Transactions of the Royal Society of London A: Mathematical‚ Physical and Engineering Sciences. Vol. 363. No. 1835. Pages 2397–2399. 2005.
Details about Panelist position statement: logic and models in computer science  BibTeX data for Panelist position statement: logic and models in computer science

[35]
Hidden verification for computational mathematics
Hanne Gottliebsen‚ Tom Kelsey and Ursula Martin
In Journal of Symbolic Computation. Vol. 39. No. 5. Pages 539–567. 2005.
Details about Hidden verification for computational mathematics  BibTeX data for Hidden verification for computational mathematics

[36]
Rocket science or social science? Involving women in the creation of computing
Ursula Martin‚ Sonia Liff‚ William H Dutton and Ann Light
2004.
Details about Rocket science or social science? Involving women in the creation of computing  BibTeX data for Rocket science or social science? Involving women in the creation of computing

[37]
Design verification for control engineering
Richard J Boulton‚ Hanne Gottliebsen‚ Ruth Hardy‚ Tom Kelsey and Ursula Martin
In IFM. Pages 21–35. 2004.
Details about Design verification for control engineering  BibTeX data for Design verification for control engineering

[38]
Design Verification for Control Engineering
Richard J. Boulton‚ Hanne Gottliebsen‚ Ruth Hardy‚ Tom Kelsey and Ursula Martin
In Eerke A. Boiten‚ John Derrick and Graeme Smith, editors, Integrated Formal Methods‚ 4th International Conference‚ IFM 2004‚ Canterbury‚ UK‚ April 4−7‚ 2004‚ Proceedings. Vol. 2999 of Lecture Notes in Computer Science. Pages 21−35. Springer. 2004.
Details about Design Verification for Control Engineering  BibTeX data for Design Verification for Control Engineering

[39]
A Hoare logic for single−input single−output continuous−time control systems
Richard Boulton‚ Ruth Hardy and Ursula Martin
In Hybrid Systems: Computation and Control. Pages 113–125. 2003.
Details about A Hoare logic for single−input single−output continuous−time control systems  BibTeX data for A Hoare logic for single−input single−output continuous−time control systems

[40]
The classification of polynomial orderings on monadic terms
Nick Cropper and Ursula Martin
In Applicable Algebra in Engineering‚ Communication and Computing. Vol. 12. No. 3. Pages 197–226. 2001.
Details about The classification of polynomial orderings on monadic terms  BibTeX data for The classification of polynomial orderings on monadic terms

[41]
Computer algebra meets automated theorem proving: Integrating Maple and PVS
Andrew Adams‚ Martin Dunstan‚ Hanne Gottliebsen‚ Tom Kelsey‚ Ursula Martin and Sam Owre
In Theorem proving in higher order logics. Pages 1349–1353. 2001.
Details about Computer algebra meets automated theorem proving: Integrating Maple and PVS  BibTeX data for Computer algebra meets automated theorem proving: Integrating Maple and PVS

[42]
A maple−pvs interface
M Dunstan‚ H Gottliebsen‚ Tom Kelsey‚ U Martin and Calculemus Workhop
In Proc. of the Calculemus Symposium 2001. 2001.
Details about A maple−pvs interface  BibTeX data for A maple−pvs interface

[43]
Computer algebra meets automated theorem proving: A maple−pvs interface
Martin Dunstan‚ Hanne Gottliebsen‚ Tom Kelsey and Ursula Martin
In Proceedings of the Calculemus Workshop. 2001.
Details about Computer algebra meets automated theorem proving: A maple−pvs interface  BibTeX data for Computer algebra meets automated theorem proving: A maple−pvs interface

[44]
Invariants‚ patterns and weights for ordering terms
Ursula Martin and Duncan Shand
In Journal of Symbolic Computation. Vol. 29. No. 6. Pages 921–957. 2000.
Details about Invariants‚ patterns and weights for ordering terms  BibTeX data for Invariants‚ patterns and weights for ordering terms

[45]
Computational logic support for differential equations and mathematical modeling
U Martin and H Gottliebsen
In Personal communication. 2000.
Details about Computational logic support for differential equations and mathematical modeling  BibTeX data for Computational logic support for differential equations and mathematical modeling

[46]
Towards formal methods for mathematical modeling
Ursula Martin
In Proceedings 5th NASA Langley Workshop on Formal Methods. 2000.
Details about Towards formal methods for mathematical modeling  BibTeX data for Towards formal methods for mathematical modeling

[47]
Formal methods for extensions to CAS
Martin N Dunstan‚ Tom Kelsey‚ Ursula Martin and Steve Linton
In Lecture notes in computer science. Pages 1758–1777. 1999.
Details about Formal methods for extensions to CAS  BibTeX data for Formal methods for extensions to CAS

[48]
Computers‚ reasoning and mathematical practice
Ursula Martin
In Computational Logic. Pages 301–346. Springer Berlin Heidelberg. 1999.
Details about Computers‚ reasoning and mathematical practice  BibTeX data for Computers‚ reasoning and mathematical practice

[49]
VSDITLU: a verifiable symbolic definite integral table look−up
Andrew A Adams‚ Hanne Gottliebsen‚ Steve A Linton and Ursula Martin
In CADE. Pages 112–126. 1999.
Details about VSDITLU: a verifiable symbolic definite integral table look−up  BibTeX data for VSDITLU: a verifiable symbolic definite integral table look−up

[50]
Automated theorem proving in support of computer algebra: symbolic definite integration as a case study
Andrew A Adams‚ Hanne Gottliebsen‚ SA Linton and Ursula Martin
In Proceedings of the 1999 international symposium on Symbolic and algebraic computation. Pages 253–260. ACM. 1999.
Details about Automated theorem proving in support of computer algebra: symbolic definite integration as a case study  BibTeX data for Automated theorem proving in support of computer algebra: symbolic definite integration as a case study

[51]
New directions for syntactic termination orderings
Ursula Martin
In Progress in Computer Science and Applied Logic. Vol. 15. Pages 209–224. 1998.
Details about New directions for syntactic termination orderings  BibTeX data for New directions for syntactic termination orderings

[52]
Lightweight formal methods for computer algebra systems
Martin Dunstan‚ Tom Kelsey‚ Steve Linton and Ursula Martin
In Proceedings of the 1998 international symposium on Symbolic and algebraic computation. Pages 80–87. ACM. 1998.
Details about Lightweight formal methods for computer algebra systems  BibTeX data for Lightweight formal methods for computer algebra systems

[53]
Steve Linton Lightweight formal methods for computer algebra systems In ISSAC�98: Proc ACM International Symposium on Symbolic and Algebraic Computation‚ Rostock
Martin Dunstan‚ Tom Kelsey and Ursula Martin
1998.
Details about Steve Linton Lightweight formal methods for computer algebra systems In ISSAC�98: Proc ACM International Symposium on Symbolic and Algebraic Computation‚ Rostock  BibTeX data for Steve Linton Lightweight formal methods for computer algebra systems In ISSAC�98: Proc ACM International Symposium on Symbolic and Algebraic Computation‚ Rostock

[54]
The Order Types of Termination Orderings on Monadic Terms‚ Strings and Monadic Terms‚ Strings and Multisets
Ursula Martin and Elizabeth Scott
1997.
Details about The Order Types of Termination Orderings on Monadic Terms‚ Strings and Monadic Terms‚ Strings and Multisets  BibTeX data for The Order Types of Termination Orderings on Monadic Terms‚ Strings and Monadic Terms‚ Strings and Multisets

[55]
The order types of termination orderings on monadic terms‚ strings and multisets
Ursula Martin and Elizabeth Scott
In The Journal of Symbolic Logic. Vol. 62. No. 2. Pages 624–635. 1997.
Details about The order types of termination orderings on monadic terms‚ strings and multisets  BibTeX data for The order types of termination orderings on monadic terms‚ strings and multisets

[56]
Investigating some embedded verification techniques for computer algebra systems
U Martin and D Shand
In Proceedings of THEOREM A Workshop. Vol. 97. Pages 20. 1997.
Details about Investigating some embedded verification techniques for computer algebra systems  BibTeX data for Investigating some embedded verification techniques for computer algebra systems

[57]
Algebra and automated deduction
Steve Linton‚ Ursula Martin‚ Péter Pröhle and Duncan Shand
In Automated Deduction�Cade−13. Pages 448–462. 1996.
Details about Algebra and automated deduction  BibTeX data for Algebra and automated deduction

[58]
Theorem proving with group presentations: examples and questions
Ursula Martin
In Automated Deduction�Cade−13. Pages 358–372. 1996.
Details about Theorem proving with group presentations: examples and questions  BibTeX data for Theorem proving with group presentations: examples and questions

[59]
The theory of termination orderings on strings: exposition and examples
U Martin
In AUSTRALIAN COMPUTER SCIENCE COMMUNICATIONS. Vol. 17. Pages 364–369. 1995.
Details about The theory of termination orderings on strings: exposition and examples  BibTeX data for The theory of termination orderings on strings: exposition and examples

[60]
On the diversity of orderings on strings
Ursula Martin
In Fundamenta Informaticae. Vol. 24. No. 1−2. Pages 25–46. 1995.
Details about On the diversity of orderings on strings  BibTeX data for On the diversity of orderings on strings

[61]
Termination‚ geometry and invariants
Ursula Martin
In International Conference on Automated Deduction. Pages 432–434. Springer‚ Berlin‚ Heidelberg. 1994.
Details about Termination‚ geometry and invariants  BibTeX data for Termination‚ geometry and invariants

[62]
Verification techniques for LOTOS
Ursula Martin and M Thomas
In FME'94: Industrial Benefit of Formal Methods. Pages 83–92. Springer Berlin/Heidelberg. 1994.
Details about Verification techniques for LOTOS  BibTeX data for Verification techniques for LOTOS

[63]
Linear interpretations by counting patterns
Ursula Martin
In Rewriting Techniques and Applications. Pages 421–433. Springer Berlin/Heidelberg. 1993.
Details about Linear interpretations by counting patterns  BibTeX data for Linear interpretations by counting patterns

[64]
The order types of termination orderings on monadic terms‚ strings and multisets
Ursula Martin and Elizabeth Scott
In Logic in Computer Science‚ 1993. LICS'93.‚ Proceedings of Eighth Annual IEEE Symposium on. Pages 356–363. IEEE. 1993.
Details about The order types of termination orderings on monadic terms‚ strings and multisets  BibTeX data for The order types of termination orderings on monadic terms‚ strings and multisets

[65]
Some experiments with a completion theorem prover
Ursula Martin and Michael Lai
In Journal of symbolic computation. Vol. 13. No. 1. Pages 81–100. 1992.
Details about Some experiments with a completion theorem prover  BibTeX data for Some experiments with a completion theorem prover

[66]
Case studies in equational reasoning
UH Martin‚ Dave Cohen‚ MKF Lai‚ KJ Norrie and Phil Watson
1990.
Details about Case studies in equational reasoning  BibTeX data for Case studies in equational reasoning

[67]
A note on division orderings on strings
Ursula Martin
In Information Processing Letters. Vol. 36. No. 5. Pages 237–240. 1990.
Details about A note on division orderings on strings  BibTeX data for A note on division orderings on strings

[68]
Automating the knuth bendix ordering
Jeremy Dick‚ John Kalmus and Ursula Martin
In Acta Informatica. Vol. 28. No. 2. Pages 95–119. 1990.
Details about Automating the knuth bendix ordering  BibTeX data for Automating the knuth bendix ordering

[69]
Ordered rewriting and confluence
Ursula Martin and Tobias Nipkow
In 10th International Conference on Automated Deduction. Pages 366–380. Springer Berlin/Heidelberg. 1990.
Details about Ordered rewriting and confluence  BibTeX data for Ordered rewriting and confluence

[70]
Equational Reasoning in Groups
U Martin
1990.
Details about Equational Reasoning in Groups  BibTeX data for Equational Reasoning in Groups

[71]
A ProCoS Project Description: ESPRIT BRA 3104
Dines Bjørner‚ CAR Hoare‚ Jonathan P Bowen‚ He Jifeng‚ Hans Langmaack‚ Ernst−Rüdiger Olderog‚ UH Martin‚ Victoria Stavridou‚ Fleming Nielson‚ Hanne Riis Nielson and others
In Bulletin of the European Association for Theoretical Computer Science (EATCS). Vol. 39. Pages 60–73. 1989.
Details about A ProCoS Project Description: ESPRIT BRA 3104  BibTeX data for A ProCoS Project Description: ESPRIT BRA 3104

[72]
Experiments with program verification systems
Bettina Buth‚ Karl−Heinz Buth‚ Ursula Martin and Victoria Stavridou
In ProCoS document Kiel BB. Vol. 2. No. 1. 1989.
Details about Experiments with program verification systems  BibTeX data for Experiments with program verification systems

[73]
A geometrical approach to multiset orderings
Ursula Martin
In Theoretical Computer Science. Vol. 67. No. 1. Pages 37–54. 1989.
Details about A geometrical approach to multiset orderings  BibTeX data for A geometrical approach to multiset orderings

[74]
Automating Squiggol
Ursula Martin and Tobias Nipkow
University of Cambridge‚ Computer Laboratory. 1989.
Details about Automating Squiggol  BibTeX data for Automating Squiggol

[75]
Unification in Special P−groups
U Martin
1989.
Details about Unification in Special P−groups  BibTeX data for Unification in Special P−groups

[76]
Unification in Boolean rings
Ursula Martin and Tobias Nipkow
In Journal of Automated Reasoning. Vol. 4. No. 4. Pages 381–396. 1988.
Details about Unification in Boolean rings  BibTeX data for Unification in Boolean rings

[77]
Logic and computation�Interactive proof with Cambridge LCF: By LC Paulson. Cambridge University Press‚ Cambridge‚ 1987‚ Price£ 27.50‚ ISBN 0 521 34632 0
Tobias Nipkow
1988.
Details about Logic and computation�Interactive proof with Cambridge LCF: By LC Paulson. Cambridge University Press‚ Cambridge‚ 1987‚ Price£ 27.50‚ ISBN 0 521 34632 0  BibTeX data for Logic and computation�Interactive proof with Cambridge LCF: By LC Paulson. Cambridge University Press‚ Cambridge‚ 1987‚ Price£ 27.50‚ ISBN 0 521 34632 0

[78]
Logic for computer science: By JH Gallier. Harper & Row‚ London‚ 1986‚ Price£ 17.95‚ ISBN 0 06 042225 4
Ursula Martin
1988.
Details about Logic for computer science: By JH Gallier. Harper & Row‚ London‚ 1986‚ Price£ 17.95‚ ISBN 0 06 042225 4  BibTeX data for Logic for computer science: By JH Gallier. Harper & Row‚ London‚ 1986‚ Price£ 17.95‚ ISBN 0 06 042225 4

[79]
Extension functions for multiset orderings
Ursula Martin
In Information Processing Letters. Vol. 26. No. 4. Pages 181–186. 1987.
Details about Extension functions for multiset orderings  BibTeX data for Extension functions for multiset orderings

[80]
How to choose the weights in the Knuth Bendix ordering
Ursula Martin
In Rewriting Techniques and Applications. Pages 42–53. Springer Berlin/Heidelberg. 1987.
Details about How to choose the weights in the Knuth Bendix ordering  BibTeX data for How to choose the weights in the Knuth Bendix ordering

[81]
Almost all −groups have automorphism group a −group
Ursula Martin
In Bulletin of the American Mathematical Society. Vol. 15. No. 1. Pages 78–82. 1986.
Details about Almost all −groups have automorphism group a −group  BibTeX data for Almost all −groups have automorphism group a −group

[82]
Unification in boolean rings
Ursula Martin and Tobias Nipkow
In International Conference on Automated Deduction. Pages 506–513. Springer‚ Berlin‚ Heidelberg. 1986.
Details about Unification in boolean rings  BibTeX data for Unification in boolean rings

[83]
Unification in Boolean Rings an Unquantified Formulae of First Order Predicate Calculus
Ursula Martin
1986.
Details about Unification in Boolean Rings an Unquantified Formulae of First Order Predicate Calculus  BibTeX data for Unification in Boolean Rings an Unquantified Formulae of First Order Predicate Calculus

[84]
Multiset Orderings
Ursula Martin
1986.
Details about Multiset Orderings  BibTeX data for Multiset Orderings

[85]
Doing algebra with REVE
Ursula Martin
1986.
Details about Doing algebra with REVE  BibTeX data for Doing algebra with REVE

[86]
Using graphs to investigate the automorphism groups of nilpotent groups
UHM Webb
In Graphs and Applications. Proc. 1st. Colorado Simp‚ on Graph Theory (John Wiley & Sons‚ New York‚ 1985). Pages 333–347. 1985.
Details about Using graphs to investigate the automorphism groups of nilpotent groups  BibTeX data for Using graphs to investigate the automorphism groups of nilpotent groups

[87]
The number of stem covers of an elementary abelianp−group
Ursula Martin Webb
In Mathematische Zeitschrift. Vol. 182. No. 3. Pages 327–337. 1983.
Details about The number of stem covers of an elementary abelianp−group  BibTeX data for The number of stem covers of an elementary abelianp−group

[88]
The occurrence of groups as automorphisms of nilpotentp−groups
UHM Webb
In Archiv der Mathematik. Vol. 37. No. 1. Pages 481–498. 1981.
Details about The occurrence of groups as automorphisms of nilpotentp−groups  BibTeX data for The occurrence of groups as automorphisms of nilpotentp−groups

[89]
An independence theorem for automorphisms of torsion−free groups
UHM Webb
In Mathematical Proceedings of the Cambridge Philosophical Society. Vol. 90. No. 3. Pages 403–409. Cambridge University Press. 1981.
Details about An independence theorem for automorphisms of torsion−free groups  BibTeX data for An independence theorem for automorphisms of torsion−free groups

[90]
Outer automorphisms of some finitely generated nilpotent groups I
UHM Webb
In Journal of the London Mathematical Society. Vol. 2. No. 2. Pages 216–224. 1980.
Details about Outer automorphisms of some finitely generated nilpotent groups I  BibTeX data for Outer automorphisms of some finitely generated nilpotent groups I

[91]
An elementary proof of Gaschütz'theorem
UHM Webb
In Archiv der Mathematik. Vol. 35. No. 1. Pages 23–26. 1980.
Details about An elementary proof of Gaschütz'theorem  BibTeX data for An elementary proof of Gaschütz'theorem

[92]
Automorphisms of finitely generated nilpotent groups.
Ursula Hilda Mary Webb
PhD Thesis University of Warwick. 1978.
Details about Automorphisms of finitely generated nilpotent groups.  BibTeX data for Automorphisms of finitely generated nilpotent groups.

[93]
The social machine of mathematics
Ursula Martin
Details about The social machine of mathematics  BibTeX data for The social machine of mathematics

[94]
Formal M ethods for Extensions to CAS (To be presented at FME'99‚ Toulouse‚ France‚ 20−24 Sep 1999)
Martin N Dunstan‚ Tom Kelsey‚ Ursula Martin and Steve Linton
Details about Formal M ethods for Extensions to CAS (To be presented at FME'99‚ Toulouse‚ France‚ 20−24 Sep 1999)  BibTeX data for Formal M ethods for Extensions to CAS (To be presented at FME'99‚ Toulouse‚ France‚ 20−24 Sep 1999)

[95]
BAN−LOGIC ANALYSIS OF THE UK POSTAL VOTING SYSTEM AS A CRYPTOGRAPHIC PROTOCOL
Tim Storer‚ Ursula Martin and Ishbel Duncan
Details about BAN−LOGIC ANALYSIS OF THE UK POSTAL VOTING SYSTEM AS A CRYPTOGRAPHIC PROTOCOL  BibTeX data for BAN−LOGIC ANALYSIS OF THE UK POSTAL VOTING SYSTEM AS A CRYPTOGRAPHIC PROTOCOL

[96]
Lightweight Formal Methods For Computer Algebra Systems
Martin Dunstan Tom Kelsey Steve Linton and Ursula Martin
Details about Lightweight Formal Methods For Computer Algebra Systems  BibTeX data for Lightweight Formal Methods For Computer Algebra Systems

[97]
A Hoare Logic for Single−Input Single−Output Continuous−Time Control Systems* Extended Abstract
Richard J Boulton‚ Ruth Hardy and Ursula Martin
Details about A Hoare Logic for Single−Input Single−Output Continuous−Time Control Systems* Extended Abstract  BibTeX data for A Hoare Logic for Single−Input Single−Output Continuous−Time Control Systems* Extended Abstract

[98]
Using the Maple−PVS Interface to Check the Continuity of Maple Expressions
Hanne Gottliebsen‚ Tom Kelsey and Ursula Martin
Details about Using the Maple−PVS Interface to Check the Continuity of Maple Expressions  BibTeX data for Using the Maple−PVS Interface to Check the Continuity of Maple Expressions

[99]
Adding Formal Proofs to Computer Algebra: A Maple−PVS Interface
Hanne Gottliebsen‚ Tom Kelsey and Ursula Martin
Details about Adding Formal Proofs to Computer Algebra: A Maple−PVS Interface  BibTeX data for Adding Formal Proofs to Computer Algebra: A Maple−PVS Interface

[100]
Towards formal methods for mathematical modeling To appear‚ 5th NASA Langley Formal Methods Workshop 2000
Ursula Martin
Details about Towards formal methods for mathematical modeling To appear‚ 5th NASA Langley Formal Methods Workshop 2000  BibTeX data for Towards formal methods for mathematical modeling To appear‚ 5th NASA Langley Formal Methods Workshop 2000