A HEDONIC PRICE APPROACH TO FLOOD RISK AND PROPERTY VALUE IN THE GREATER MIAMI AREA

This study investigates the relationship between property value and flood risk in Miami-Dade County Florida. Miami-Dade County has gained a lot of attention in the media for its high risk of catastrophic flooding. As climate change predictions have grown more severe, flood risk is a factor property buyers may want to consider. This study uses hedonic pricing to see if the flood risk in the county affects the price of the home. In Miami-Dade County, properties near a public beach are considered desirable. This paper specifically looks at the interaction between distance from the beach and flood risk. This paper found Low flood risk homes have significantly lower prices than high flood risk homes if they are close to the beach (less than 45 miles), but have significantly higher prices than high risk homes that are far from the beach (at least 45 miles away). Specifically, when a home is that far away from the water, being flood safe adds a positive value to a property by around 14%. Similarly, being in a high flood risk (FEMA AE) has a positive marginal effect on the price of a home if it is close enough to a public beach

An introduction to finite automata and their connection to logic

This is a tutorial on finite automata. We present the standard material on determinization and minimization, as well as an account of the equivalence of finite automata and monadic second-order logic. We conclude with an introduction to the syntactic monoid, and as an application give a proof of the equivalence of first-order definability and aperiodicity

An effective characterization of the alternation hierarchy in two-variable logic

We characterize the languages in the individual levels of the quantifier alternation hierarchy of first-order logic with two variables by identities. This implies decidability of the individual levels. More generally we show that the two-sided semidirect product of a decidable variety with the variety J is decidable

Algebraic Characterization of the Alternation Hierarchy in FO^2[<] on Finite Words

We give an algebraic characterization of the quantifier alternation hierarchy in first-order two-variable logic on finite words. As a result, we obtain a new proof that this hierarchy is strict. We also show that the first two levels of the hierarchy have decidable membership problems, and conjecture an algebraic decision procedure for the other levels

Wreath Products of Forest Algebras, with Applications to Tree Logics

We use the recently developed theory of forest algebras to find algebraic characterizations of the languages of unranked trees and forests definable in various logics. These include the temporal logics CTL and EF, and first-order logic over the ancestor relation. While the characterizations are in general non-effective, we are able to use them to formulate necessary conditions for definability and provide new proofs that a number of languages are not definable in these logics

Remedies

By investigating how memory works and how washing and mending lend them[selves] metaphorically to healing, I seek to discover how women of today experience the process of repairing themselves after their own sexual violence. For this thesis project I was interested specifically in women\u27s stories of how they have dealt with violence in their own lives. By interviewing a group of women, I discovered how they have tried to metaphorically wash and mend themselves after their sexual violation occurred [...]. As an artist, I have chosen glass as my primary material for its inherent physical properties. Glass resembles the concept of a translucent, cloudy memory, perhaps left behind and forgotten [...]. The techniques and uses of windows, stains, stitching, scarring, and thread become important metaphors for memory and violence as well

Piecewise testable tree languages

This paper presents a decidable characterization of tree languages that can be defined by a boolean combination of Sigma_1 sentences. This is a tree extension of the Simon theorem, which says that a string language can be defined by a boolean combination of Sigma_1 sentences if and only if its syntactic monoid is J-trivial