Search 250 million research papers

Formality

Cochrane, Guy · Dipòsit Digital de Documents de la UAB (Universitat Autònoma de Barcelona) · 1981

Cited by 0Open access

Formality

Deborah Bernhardt · Project Muse (Johns Hopkins University) · 2016

Cited by 0

Formality

Neil Andrews · Oxford University Press eBooks · 2021

Abstract The main formalities concern the making of deed or covenants in order to give effect to gratuitous promises (the deed is formalized by the covenantor’s signature, and attestation by a witness to the signature, and delivery of the deed to the covenantee, who need not be present at the time the instrument is executed). Contracts concerning land also need to satisfy the formality of a writing. Although the tendency of English law has been to retreat from formality, various statutory exceptions are examined, notably contracts of guarantee. English law has recognized a ‘no oral modification’ clause, which requires any variation to comply with the prescribed written formality.

Cited by 0

Formality

Bryce Emley · Journal of International Crisis and Risk Communication Research · 2011

Of the many aspects of the composition of poetry, the most common component of the form involves emotional response. There is an infinite number of ways to write a poem, and likewise an infinite number of forms which a poem can be structured according to. In writing this collection of poems composing my thesis, I set out to write poetry in as many ways as I could to explore how different forms, devices, voices, points of view, sounds, tones, and as many other variables as I could think of affect poetry as stimulus. The poems in this collection cover a range of classic poetic forms and styles as well as variations of free verse and contemporary forms. My hope is that the readers of these poems will be able to experience a wide range of emotional responses and gain the same insight into the vast abilities inherent in poetry that I gained in writing them.

Cited by 0Open access

Formality

Ilias Bantekas, Ahmed Al-Ahmed · Cambridge University Press eBooks · 2023

<p dir="ltr">In chapter 2 we discussed contract formation in general, whereas here we shall dive deeper into formality and delivery in particular. Before doing so, we need to lay the foundations by which to evaluate the legal impact of formality and delivery on civil and commercial contracts. It will be recalled that under the civil law tradition, contracts are predicated on three general pillars, namely: (i) consent, consisting of offer, acceptance and intention to be legally bound; (ii) subject-matter; and (iii) cause. In addition, there may, although not necessarily, exist two further requirements (special pillars), namely: (iv) formality; and (v) delivery. <h2>Other Information</h2><p dir="ltr">Published in: Contract Law of Qatar<br>License: <a href="https://creativecommons.org/licenses/by-nc/4.0/deed.en" rel="noreferrer noopener" target="_blank">https://creativecommons.org/licenses/by-nc/4.0/</a><br>See chapter on publisher's website: <a href="https://dx.doi.org/10.1017/9781009052009.006" target="_blank">https://dx.doi.org/10.1017/9781009052009.006</a>

Cited by 0Open access

Formality

Andrea Iacona · Springer undergraduate texts in philosophy · 2021

Cited by 0

Formality

Emley, Bryce · Journal of International Crisis and Risk Communication Research · 2011

Of the many aspects of the composition of poetry, the most common component of the form involves emotional response. There is an infinite number of ways to write a poem, and likewise an infinite number of forms which a poem can be structured according to. In writing this collection of poems composing my thesis, I set out to write poetry in as many ways as I could to explore how different forms, devices, voices, points of view, sounds, tones, and as many other variables as I could think of affect poetry as stimulus. The poems in this collection cover a range of classic poetic forms and styles as well as variations of free verse and contemporary forms. My hope is that the readers of these poems will be able to experience a wide range of emotional responses and gain the same insight into the vast abilities inherent in poetry that I gained in writing them.

Cited by 0Open access

Formality Works

Hoogerwoord, R.R. · Data Archiving and Networked Services (DANS) · 2000

Cited by 0

Only formality

David Dickson · DigitalGeorgetown (Georgetown University Library) · 1982

Cited by 0

Formality works

Hoogerwoord, RR Rob · Data Archiving and Networked Services (DANS) · 2012

Cited by 0

BV formality

Ricardo Campos · Advances in Mathematics · 2016

Cited by 12

8 Formality

Vasiliy Dolgushev, Dmitry Tamarkin, Boris Tsygan · 2016

Cited by 0

Incremental Formality: Where Formality and Informality Meet

Neyra Velarde, Rodrigo · DigitalCommons - Kennesaw State University (Kennesaw State University) · 2022

1500’s colonization and it is now home to one of the fastest growing informal settlement cities in Latin America. These settlement cities are often characterized by their lack of accessibility to clean water, unsafe living environments paired with lower-quality, or non-durable materials, as well as a general lack of recognition by governments. With Lima being located in the middle of the desert, sustainable design in general has been difficult to implement. This thesis looks to explore methods to create a low-cost mixed-use building with implantations of urban farming the people of Villa Maria Del Triunfo. Though the Peruvian government has acknowledged the growing population of these informal invaders, they have failed to adapt to their needs, leaving nearly 30% of Lima’s residents to live in these extreme conditions. This project further investigates opportunities to develop these environments and grow with the suffering populations in Villa Maria Del Triunfo.

Cited by 0

Formality works

Hoogerwoord, RR Rob · TU/e Research Portal (Eindhoven University of Technology) · 2012

Cited by 0

Noncommutative formality implies commutative and Lie formality

Bashar Saleh · Algebraic & Geometric Topology · 2017

Over a field of characteristic zero we prove two formality conditions. We prove that a dg Lie algebra is formal if and only if its universal enveloping algebra is formal. We also prove that a commutative dg algebra is formal as a dg associative algebra if and only if it is formal as a commutative dg algebra. We present some consequences of these theorems in rational homotopy theory.

Cited by 10Open access

Characterizing Formality

Güler, Demen · Universitätsbibliothek Tübingen · 2019

Complexity classes are defined by quantitative restrictions of resources available to a computational model, like for instance the Turing machine. Contrarily, there is no obvious commonality in the definition of families of formal languages - instead they are described by example. This thesis is about the characterization of what makes a set of languages a family of formal languages. Families of formal languages, like for example the regular, context-free languages and their sub-families exhibit properties that are contrasted by the ones of complexity classes. Two of the properties families of formal languages seem to have is closure of intersection with regular languages, another is the existence of pumping or iteration arguments which yield the decidability of the emptiness. Complexity classes do not generally have a decidable emptiness, which lead us to a first candidate for the notion of formality - the decidability of the emptiness of regular intersection (intreg). We refute the decidability of intreg as a criterion by hiding the difficulty of deciding the emptiness of regular intersection: We show that for every decidable language L there is a language L' of essentially the same complexity such that intreg(L') is decidable. This implies that every complexity class contains complete languages for which the emptiness of regular intersection is decidable. An intermediate result we show is that the set of true quantified Boolean formulae has a decidable emptiness of regular intersection. As the known families of formal languages are all contained in NP, this yields a language (probably) outside of NP for which intreg is decidable, which additionally is a natural language in contrast to the artificial ones obtained by the hiding process. We introduce the notion of protocol languages which capture in some sense the behavior of a data-structure underlying the model of a formal language. They are defined in a fragment of second order logic, where the second order variables are uniquely determined by each word in the language and each letter implies a determined sub-structure of a word. Viewing the letters of a word as vertices and the successor as edges between them, each word can be seen as a path. The binary second order variables can be viewed as additional edges between word positions. Therefore, each word in a protocol language defines some unique graph. These graphs can be recognized by covering them with a predefined set of tiles which are node and edge-labeld graphs. Additional numerical constraints on the amount of each tile-type yields shrinking-arguments for protocol languages. If a word w in a protocol language exceeds a certain length such that the numerical constraints are (over-)satisfied, one can constuctively generate a shorter word w' from w that is also contained in the protocol language. We define logical extensions of protocol languages by allowing the conjunction of additional first order or monadic second order definable formulae and analyze the extensions in regard to trio operations. Protocol languages for the regular, context-free and indexed languages are exhibited -- for the first two we give protocol languages which act as generators for the respective family of formal languages. Finally, we show that the emptiness of protocol languages is decidable.

Cited by 0Open access

Formality works

Hoogerwoord, RR Rob · TU/e Research Portal (Eindhoven University of Technology) · 2001

Cited by 0

Fiesso Formality

M. Narpozzi, MAGNANI, CARLO, ROCCHETTO, STEFANO · AirIuav (Università Iuav di Venezia) · 1988

Cited by 0

Only Formality

Dickson, David · DigitalGeorgetown (Georgetown University Library) · 1982

Cited by 0

Formality Works

Hoogerwoord, R.R. · Data Archiving and Networked Services (DANS) · 2000

Cited by 0