Further tweaks

SamAdamDay · Feb 10, 2023 · d951bec · d951bec
1 parent 36cd204
commit d951bec
Show file tree

Hide file tree

Showing 7 changed files with 8 additions and 61 deletions.
diff --git a/_bibliography/papers.bib b/_bibliography/papers.bib
@@ -34,6 +34,7 @@ @article{adam-day-2022-continuous-gradability
   arxiv = {2107.14718},
   abstract = {An \(\mathbb R\)-tree is a certain kind of metric space tree in which every point can be branching. Favre and Jonsson posed the following problem in 2004: can the class of orders underlying \(\mathbb R\)-trees be characterised by the fact that every branch is order-isomorphic to a real interval? In the first part, I answer this question in the negative: there is a 'branchwise-real tree order' which is not `continuously gradable'. In the second part, I show that a branchwise-real tree order is continuously gradable if and only if every well-stratified subtree is \(\mathbb R\)-gradable. This link with set theory is put to work in the third part answering refinements of the main question, yielding several independence results. For example, when \(\kappa \geq \mathfrak c\), there is a branchwise-real tree order which is not continuously gradable, and which satisfies a property corresponding to \(\kappa\)-separability. Conversely, under Martin's Axiom at \(\kappa\) such a tree does not exist.},
   preview = {tree-geodesics.png},
+  abbr = {TA},
   selected = {true},
 }
 
@@ -80,6 +81,7 @@ @misc{adam-day-2022-poly-completeness
   arxiv = {2112.07518},
   abstract = {We investigate a recently-devised polyhedral semantics for intermediate logics, in which formulas are interpreted in n-dimensional polyhedra. An intermediate logic is polyhedrally complete if it is complete with respect to some class of polyhedra. The first main result of this paper is a necessary and sufficient condition for the polyhedral-completeness of a logic. This condition, which we call the Nerve Criterion, is expressed in terms of Alexandrov's notion of the nerve of a poset. It affords a purely combinatorial characterisation of polyhedrally-complete logics. Using the Nerve Criterion we show, easily, that there are continuum many intermediate logics that are not polyhedrally-complete but which have the finite model property. We also provide, at considerable combinatorial labour, a countably infinite class of logics axiomatised by the Jankov-Fine formulas of 'starlike trees' all of which are polyhedrally-complete. The polyhedral completeness theorem for these 'starlike logics' is the second main result of this paper.},
   preview = {elementary-subdivisions.png},
+  abbr = {JSL},
 }
 
 @mastersthesis{adam-day-2019-msc-thesis,

diff --git a/_data/repositories.yml b/_data/repositories.yml
diff --git a/_data/venues.yml b/_data/venues.yml
@@ -1,6 +1,5 @@
-"AJP":
-  url: https://aapt.scitation.org/journal/ajp
-  color: "#00369f"
+"TA":
+  url: https://www.sciencedirect.com/journal/topology-and-its-applications
 
-"PhysRev":
-  url: https://journals.aps.org/
+"JSL":
+  url: https://www.cambridge.org/core/journals/journal-of-symbolic-logic
diff --git a/_pages/about.md b/_pages/about.md
@@ -17,7 +17,7 @@ social: true  # includes social icons at the bottom of the page
 
 
 
-Currently I am in my final of a PhD at the [Mathematical Institute](https://www.maths.ox.ac.uk/) the [University of Oxford](https://www.ox.ac.uk/).
+Currently I am in my final of a PhD at the [Mathematical Institute](https://www.maths.ox.ac.uk/) of the [University of Oxford](https://www.ox.ac.uk/).
 
 The following are broadly my current research interests. See also my [list of publications](/publications).
 - Multi-agent cooperation

diff --git a/_pages/repositories.md b/_pages/repositories.md
diff --git a/_pages/teaching.md b/_pages/teaching.md
diff --git a/news.html b/news.html
@@ -1,6 +1,6 @@
 ---
 layout: page
-title: news
+title: News
 permalink: /news/
 ---