One takes advantage of some basic properties of every homotopic \(\lambda\)-model (e.g. extensional Kan complex) to explore the higher \(\beta\eta\)-conversions, which would correspond to proofs of equality between terms of a theory of equality of any extensional Kan complex. Besides, Identity types based on computational paths are adapted to a type-free theory with higher \(\lambda\)-terms, whose equality rules would be contained in the theory of any \(\lambda\)-homotopic model.

An appropriate framework is put forward for the construction of $$\lambda $$ -models with $$\infty $$ -groupoid structure, which we call homotopic $$\lambda $$ -models, through the use of an $$\infty $$ -category with cartesian closure and enough points. With this, we establish the start of a project of generalization of Domain Theory and $$\lambda $$ -calculus, in the sense that the concept of proof (path) of equality of $$\lambda $$ -terms is raised to higher (...) proof (homotopy). (shrink)

The lambda model of Feldman & Levin for intentional hand movement is compared with a hemispheric motor model (IIMM). Both models imply similar conclusions independently. This increases the validity of both models.

The lambda model provides a physiologically grounded terminology for describing muscle function and emphasizes the important influence of environmental and reflex-mediated effects on final states. However, lambda itself is only a convenient point on the length-tension curve; its importance should not be overemphasized. Ascribing movement to changes in a lambda-based frame of reference is generally valid, but it leaves unanswered a number of questions concerning mechanisms.

Although it provides a useful description of elementary movement trajectories, we argue that the delta-lognormal model is deficient as an account of speed/accuracy tradeoffs in aimed movements. It fails in this regard because (1) it is deterministic, (2) its formulation ignores critical task elements, and (3) it fails to account for the corrective role of submovements.

Let T be the theory of dense cyclically ordered sets with at least two elements. We determine the classifying space of $\mathsf {Mod}(T)$ to be homotopically equivalent to $\mathbb {CP}^\infty $. In particular, $\pi _2(\lvert \mathsf {Mod}(T)\rvert )=\mathbb {Z}$, which answers a question in our previous work. The computation is based on Connes’ cycle category $\Lambda $.

The 3D Prandtl fluid flow through a bidirectional extending surface is analytically investigated. Cattaneo–Christov fluid model is employed to govern the heat and mass flux during fluid motion. The Prandtl fluid motion is mathematically modeled using the law of conservations of mass, momentum, and energy. The set of coupled nonlinear PDEs is converted to ODEs by employing appropriate similarity relations. The system of coupled ODEs is analytically solved using the well-established mathematical technique of HAM. The impacts of various physical (...) parameters over the fluid state variables are investigated by displaying their corresponding plots. The augmenting Prandtl parameter enhances the fluid velocity and reduces the temperature and concentration of the fluid. The momentum boundary layer boosts while the thermal boundary layer mitigates with the rising elastic parameter strength. Furthermore, the enhancing thermal relaxation parameter ) reduces the temperature distribution, whereas the augmenting concentration parameter drops the strength of the concentration profile. The increasing Prandtl parameter declines the fluid temperature while the augmenting Schmidt number drops the fluid concentration. The comparison of the HAM technique with the numerical solution shows an excellent agreement and hence ascertains the accuracy of the applied analytical technique. This work finds applications in numerous fields involving the flow of non-Newtonian fluids. (shrink)

Mitchell, J.C. and E. Moggi, Kripke-style models for typed lambda calculus, Annals of Pure and Applied Logic 51 99–124. The semantics of typed lambda calculus is usually described using Henkin models, consisting of functions over some collection of sets, or concrete cartesian closed categories, which are essentially equivalent. We describe a more general class of Kripke-style models. In categorical terms, our Kripke lambda models are cartesian closed subcategories of the presheaves over a poset. To those familiar with (...) Kripke models of modal or intuitionistic logics, Kripke lambda models are likely to seem adequately ‘semantic’. However, when viewed as cartesian closed categories, they do not have the property variously referred to as concreteness, well- pointedness or having enough points. While the traditional lambda calculus proof system is not complete for Henkin models that may have empty types, we prove strong completeness for Kripke models. In fact, every set of equations that is closed under implication is the theory of a single Kripke model. We also develop some properties of logical relations over Kripke structures, showing that every theory is the theory of a model determined by a Kripke equivalence relation over a Henkin model. We discuss cartesian closed categories but present the main definitions and results without the use of category theory. (shrink)

The purpose of this article is to present several immediate consequences of the introduction of a new constant called Lambda in order to represent the object ``nothing" or ``void" into a standard set theory. The use of Lambda will appear natural thanks to its role of condition of possibility of sets. On a conceptual level, the use of Lambda leads to a legitimation of the empty set and to a redefinition of the notion of set. It lets (...) also clearly appear the distinction between the empty set, the nothing and the ur-elements. On a technical level, we introduce the notion of pre-element and we suggest a formal definition of the nothing distinct of that of the null-class. Among other results, we get a relative resolution of the anomaly of the intersection of a family free of sets and the possibility of building the empty set from ``nothing". The theory is presented with equi-consistency results . On both conceptual and technical levels, the introduction of Lambda leads to a resolution of the Russell's puzzle of the null-class. (shrink)

Vector models of language are based on the contextual aspects of language, the distributions of words and how they co-occur in text. Truth conditional models focus on the logical aspects of language, compositional properties of words and how they compose to form sentences. In the truth conditional approach, the denotation of a sentence determines its truth conditions, which can be taken to be a truth value, a set of possible worlds, a context change potential, or similar. In the vector models, (...) the degree of co-occurrence of words in context determines how similar the meanings of words are. In this paper, we put these two models together and develop a vector semantics for language based on the simply typed lambda calculus models of natural language. We provide two types of vector semantics: a static one that uses techniques familiar from the truth conditional tradition and a dynamic one based on a form of dynamic interpretation inspired by Heim’s context change potentials. We show how the dynamic model can be applied to entailment between a corpus and a sentence and provide examples. (shrink)

The lambda-calculus lies at the very foundation of computer science. Besides its historical role in computability theory it has had significant influence on programming language design and implementation, denotational semantics and domain theory. The book emphasizes the proof theory for the type-free lambda-calculus. The first six chapters concern this calculus and cover the basic theory, reduction, models, computability, and the relationship between the lambda-calculus and combinatory logic. Chapter 7 presents a variety of typed calculi; first the simply (...) typed lambda-calculus, then Milner-style polymorphism and, finally the polymporphic lambda-calculus. Chapter 8 concerns three variants of the type-free lambda-calculus that have recently appeared in the research literature: the lazy lambda-calculus, the concurrent y-calculus and the lamdba omega-calculus. The final chapter contains references and a guide to further reading. There are exercises throughout. In contrast to earlier books on these topics, which were written by logicians, the book is written from a computer science perspective and emphasizes the practical relevance of many of the key theoretical ideas. The book is intended as a course text for final year undergraduates or first year graduate students in computer science. Research students should find it a useful introduction to more specialist literature. (shrink)

The revised edition contains a new chapter which provides an elegant description of the semantics. The various classes of lambda calculus models are described in a uniform manner. Some didactical improvements have been made to this edition. An example of a simple model is given and then the general theory (of categorical models) is developed. Indications are given of those parts of the book which can be used to form a coherent course.

Vector models of language are based on the contextual aspects of words and how they co-occur in text. Truth conditional models focus on the logical aspects of language, the denotations of phrases, and their compositional properties. In the latter approach the denotation of a sentence determines its truth conditions and can be taken to be a truth value, a set of possible worlds, a context change potential, or similar. In this short paper, we develop a vector semantics for language based (...) on the simply typed lambda calculus. Our semantics uses techniques familiar from the truth conditional tradition and is based on a form of dynamic interpretation inspired by Heim's context updates. (shrink)

This book describes the mathematical aspects of the semantics of programming languages. The main goals are to provide formal tools to assess the meaning of programming constructs in both a language-independent and a machine-independent way, and to prove properties about programs, such as whether they terminate, or whether their result is a solution of the problem they are supposed to solve. In order to achieve this the authors first present, in an elementary and unified way, the theory of certain topological (...) spaces that have proved of use in the modelling of various families of typed lambda calculi considered as core programming languages and as meta-languages for denotational semantics. This theory is now known as Domain Theory, and was founded as a subject by Scott and Plotkin. One of the main concerns is to establish links between mathematical structures and more syntactic approaches to semantics, often referred to as operational semantics, which is also described. This dual approach has the double advantage of motivating computer scientists to do some mathematics and of interesting mathematicians in unfamiliar application areas from computer science. (shrink)

The lambda model of servocontrol seems superior to the alpha model in terms of dealing with the mechanical complexities of nonlinear and multiarticular muscles. Both, however, can be trivialized by noting that the “control variable” may simply be the sum of descending influences at propriospinal interneurons in the case of the lambda model or in the muscles themselves in the case of the alpha model. The notion that the brain explicitly computes output in terms (...) of any such control variables may be an engineering metaphor, useful for conceptual understanding but not for generating predictive hypotheses about higher motor circuitry. (shrink)

In Plamondon & Alimi's target article, a bell-shaped velocity profile typically observed in fast movements is used as a basis for the of motor control. In our opinion, kinematics is a necessary but insufficient ground for a theory of motor control. Relationships between different kinematic characteristics are an emergent property of the system dynamics controlled by the brain in a specific way. In particular, bell-shaped velocity profiles with or without additional waves are a trivial consequence of shifts in the equilibrium (...) state of the system as suggested, for example, in the [lambda]-model of motor control. (shrink)

Parameters of the lambda model seem tightly linked to certain characteristics of human performance influenced by weightlessness. This commentary suggests that there is a valuable opportunity to probe the lambda model using the changed environment experienced during space flight. The likely benefits are a better model and a better understanding ofthe consequences of weightlessness for human performance.

The [lambda]-calculus can be represented topologically by assigning certain spaces to the types and certain continuous maps to the terms. Using a recent result from category theory, the usual calculus of [lambda]-conversion is shown to be deductively complete with respect to such topological semantics. It is also shown to be functionally complete, in the sense that there is always a ‘minimal’ topological model in which every continuous function is [lambda]-definable. These results subsume earlier ones using cartesian (...) closed categories, as well as those employing so-called Henkin and Kripke [lambda]-models. (shrink)

PurposeThyroid-associated ophthalmopathy is a vision threatening autoimmune and inflammatory orbital disease, and has been reported to be associated with a wide range of structural and functional abnormalities of bilateral hemispheres. However, whether the interhemisphere functional connectivity of TAO patients is altered still remain unclear. A new technique called voxel-mirrored homotopic connectivity combined with support vector machine method was used in the present study to explore interhemispheric homotopic functional connectivity alterations in patients with TAO.MethodsA total of 21 TAO patients (...) and 21 wellmatched healthy controls, respectively, underwent functional magnetic resonance imaging scanning in the resting state. We evaluated alterations in the resting state functional connectivity between hemispheres by applying VMHC method and then selected these abnormal brain regions as seed areas for subsequent study using FC method. Furthermore, the observed changes of regions in the VMHC analysis were chosen as classification features to differentiate patients with TAO from HCs through support vector machine method.ResultsThe results showed that compared with HCs, TAO patients showed significantly lower VMHC values in the bilateral postcentral gyrus, lingual gyrus, calcarine, middle temporal gyrus, middle occipital gyrus and angular. Moreover, significantly decreased FC values were found between the right postcentral gyrus/lingual gyrus/calcarine and left lingual gyrus/cuneus/superior occipital gyrus, left postcentral gyrus/lingual gyrus/calcarine and right lingual gyrus/ middle temporal gyrus, right middle temporal gyrus and left cerebellum-8/lingual gyrus/middle occipital gyrus/supplementary motor area, left middle temporal gyrus and right middle occipital gyrus, right middle occipital gyrus/angular and left middle temporal pole. The SVM classification model achieved good performance in differentiating TAO patients from HCs.ConclusionThe present study revealed that the altered interhemisphere interaction and integration of information involved in cognitive and visual information processing pathways including the postcentral gyrus, cuneus, cerebellum, angular, widespread visual cortex and temporal cortex in patients with TAO relative to HC group. VMHC variability had potential value for accurately and specifically distinguishing patients with TAO from HCs. The new findings may provide novel insights into the neurological mechanisms underlying visual and cognitive disorders in patients with TAO. (shrink)

A key feature of the lambda model is the hypothesis of a local spring-like muscle-reflex system defined by a central control variable that has units of position. This is intriguing, especially for a study of postural stability in large-scale systems, but it has limited direct application to skilled everyday movements. If movement is considered as a goal-directed, neuro-optimization problem, however, theavailabilityof lambda-like peripheral models (vs. conventional musculoskeletal models) deserves exploration.

The third author gave a natural deduction style proof system called the \-calculus for implicational fragment of classical logic in. In -calculus, 2015, Post-proceedings of the RIMS Workshop “Proof Theory, Computability Theory and Related Issues”, to appear), the fourth author gave a natural subsystem “intuitionistic \-calculus” of the \-calculus, and showed the system corresponds to intuitionistic logic. The proof is given with tree sequent calculus, but is complicated. In this paper, we introduce some reduction rules for the \-calculus, and give (...) a simple and purely syntactical proof to the theorem by use of the reduction. In addition, we show that we can give a computation model with rich expressive power with our system. (shrink)

The \CDM cosmological model is remarkable: with just six parameters it describes the evolution of the Universe from a very early time when all structures were quantum fluctuations on subatomic scales to the present, and it is consistent with a wealth of high-precision data, both laboratory measurements and astronomical observations. However, the foundation of \CDM involves physics beyond the standard model of particle physics: particle dark matter, dark energy and cosmic inflation. Until this ‘new physics’ is clarified, \CDM (...) is at best incomplete and at worst a phenomenological construct that accommodates the data. I discuss the path forward, which involves both discovery and disruption, some grand challenges and finally the limits of scientific cosmology. (shrink)

The introduction of Linear Logic extends the Curry-Howard Isomorphism to intensional aspects of the typed functional programming. In particular, every formula of Linear Logic tells whether the term it is a type for, can be either erased/duplicated or not, during a computation. So, Linear Logic can be seen as a model of a computational environment with an explicit control about the management of resources.

It is well known that the self-energy of the gauge bosons is quadratically divergent in the Standard Model when a simple cutoff is imposed. We demonstrate phenomenologically that the quadratic divergences in fact unify. The unification occurs at a surprisingly low scale, \(\Lambda _\mathrm {u}\approx 4\times 10^7\) GeV. Suppose now that there is a spontaneously broken rotational symmetry between the space-time coordinates and gauge theoretical phases. The symmetry-breaking pattern is such that the gauge bosons arise as the massless (...) Goldstone bosons, whereas the dilatonic mode acts as the massive (Higgs) boson, whose vacuum expectation value determines the gauge couplings. In this case, the quadratic divergences or the tadpoles of the gauge boson self-energy should indeed unify because these divergences need to be cancelled by a universal dilatonic contribution, assuming dynamical symmetry breaking. If there is dynamical symmetry breaking, we are in principle able to calculate the value of the gauge couplings as well as the scale hierarchy \(\Lambda _\mathrm {cut}/\Lambda _\mathrm {u}\) . We perform this calculation by adopting a naive quartic symmetry-breaking potential which unfortunately violates local gauge invariance. Using tadpole-cancellation and dilatonic self-energy conditions, the value of \(\Lambda _\mathrm {cut}\) is then found to be approximately \(4\times 10^{18}\) GeV in the Feynman gauge and \(5\times 10^{15}\) GeV in the Landau gauge. The cancellation of an anomaly in the dilaton self-energy requires that the number of fermionic generations equals three. The symmetry-breaking needs to be driven by some other mass-generating mechanism such as electroweak symmetry breaking. Our estimation for \(\Lambda _\mathrm {u}\) is of the correct order if \(\Lambda _\mathrm {cut}\approx 5\times 10^{15}\) GeV. (shrink)

For any ordinal $\Lambda$, we can define a polymodal logic $\mathsf{GLP}_\Lambda$, with a modality $[\xi]$ for each $\xi < \Lambda$. These represent provability predicates of increasing strength. Although $\mathsf{GLP}_\Lambda$ has no Kripke models, Ignatiev showed that indeed one can construct a Kripke model of the variable-free fragment with natural number modalities, denoted $\mathsf{GLP}^0_\omega$. Later, Icard defined a topological model for $\mathsf{GLP}^0_\omega$ which is very closely related to Ignatiev's. In this paper we show how to (...) extend these constructions for arbitrary $\Lambda$. More generally, for each $\Theta,\Lambda$ we build a Kripke model $\mathfrak I^\Theta_\Lambda$ and a topological model $\mathfrak T^\Theta_\Lambda$, and show that $\mathsf{GLP}^0_\Lambda$ is sound for both of these structures, as well as complete, provided $\Theta$ is large enough. (shrink)

A λ-theory T is a consistent set of equations between λ-terms closed under derivability. The degree of T is the degree of the set of Godel numbers of its elements. H is the $\lamda$ -theory axiomatized by the set {M = N ∣ M, N unsolvable. A $\lamda$ -theory is sensible $\operatorname{iff} T \supset \mathscr{H}$ , for a motivation see [6] and [4]. In § it is proved that the theory H is ∑ 0 2 -complete. We present Wadsworth's proof (...) that its unique maximal consistent extention $\mathscr{H}^\ast (= \mathrm{T}(D_\infty))$ is Π 0 2 -complete. In $\S2$ it is proved that $\mathscr{H}_\eta(= \lambda_\eta-\text{Calculus} + \mathscr{H})$ is not closed under the ω-rule (see [1]). In $\S3$ arguments are given to conjecture that $\mathscr{H}\omega (= \lambda + \mathscr{H} + omega-rule)$ is Π 1 1 -complete. This is done by representing recursive sets of sequence numbers as λ-terms and by connecting wellfoundedness of trees with provability in Hω. In $\S4$ an infinite set of equations independent over H η will be constructed. From this it follows that there are 2^{ℵ_0 sensible theories T such that $\mathscr{H} \subset T \subset \mathscr{H}^\ast$ and 2 ℵ 0 sensible hard models of arbitrarily high degrees. In $\S5$ some nonprovability results needed in $\S\S1$ and 2 are established. For this purpose one uses the theory H η extended with a reduction relation for which the Church-Rosser theorem holds. The concept of Gross reduction is used in order to show that certain terms have no common reduct. (shrink)

The introduction of Linear Logic extends the Curry-Howard Isomorphism to intensional aspects of the typed functional programming. In particular, every formula of Linear Logic tells whether the term it is a type for, can be either erased/duplicated or not, during a computation. So, Linear Logic can be seen as a model of a computational environment with an explicit control about the management of resources.This paper introduces a typed functional language Λ! and a categorical model for it.The terms of (...) Λ! encode a version of natural deduction for Intuitionistic Linear Logic such that linear and non linear assumptions are managed multiplicatively and additively, respectively. Correspondingly, the terms of Λ! are built out of two disjoint sets of variables. Moreover, the λ-abstractions of Λ! bind variables and patterns. The use of two different kinds of variables and the patterns allow a very compact definition of the one-step operational semantics of Λ!, unlike all other extensions of Curry-Howard Isomorphism to Intuitionistic Linear Logic. The language Λ! is Church-Rosser and enjoys both Strong Normalizability and Subject Reduction.The categorical model induces operational equivalences like, for example, a set of extensional equivalences.The paper presents also an untyped version of Λ! and a type assignment for it, using formulas of Linear Logic as types. The type assignment inherits from Λ! all the good computational properties and enjoys also the Principal-Type Property. (shrink)

We introduce a homotopy-theoretic interpretation of intuitionistic first-order logic based on ideas from Homotopy Type Theory. We provide a categorical formulation of this interpretation using the framework of Grothendieck fibrations. We then use this formulation to prove the central property of this interpretation, namely homotopy invariance. To do this, we use the result from [8] that any Grothendieck fibration of the kind being considered can automatically be upgraded to a two-dimensional fibration, after which the invariance property is reduced to an (...) abstract theorem concerning pseudonatural transformations of morphisms into two-dimensional fibrations. (shrink)

We present a characterization of supercompactness measures for ω1 in L(R), and of countable products of such measures, using inner models. We give two applications of this characterization, the first obtaining the consistency of $\delta_3^1 = \omega_2$ with $ZFC+AD^{L(R)}$ , and the second proving the uniqueness of the supercompactness measure over ${\cal P}_{\omega_1} (\lambda)$ in L(R) for $\lambda > \delta_1^2$.

Working in Z + KP, we give a new proof that the class of hereditarily finite sets cannot be proved to be a set in Zermelo set theory, extend the method to establish other failures of replacement, and exhibit a formula Φ(λ, a) such that for any sequence $\langle A_{\lambda} \mid \lambda \text{a limit ordinal} \rangle$ where for each $\lambda, A_{\lambda} \subseteq ^{\lambda}2$ , there is a supertransitive inner model of Zermelo containing all ordinals (...) in which for every λ A λ = {α ∣Φ(λ, a)}. (shrink)

We give here a model-theoretical solution to the problem, raised by J.L: Krivine, of the consistency of λβη+U(G)+Ω=t, wheret is an arbitrary λ-term,G an arbitrary finite group of order, sayn, andU(G) the theory which expresses the existence of a surjectiven-tuple notion, such that each element ofG behaves simultaneously as a permutation of the components of then-tuple and as an automorphism of the model. This provides in particular a semantic proof of the βη-easiness of the λ-term Ω.

A categorical structure suitable for interpreting polymorphic lambda calculus (PLC) is defined, providing an algebraic semantics for PLC which is sound and complete. In fact, there is an equivalence between the theories and the categories. Also presented is a definitional extension of PLC including "subtypes", for example, equality subtypes, together with a construction providing models of the extended language, and a context for Girard's extension of the Dialectica interpretation.

We define a rich model to be one which contains a proper elementary substructure isomorphic to itself. Existence, nonstructure, and categoricity theorems for rich models are proved. A theory T which has fewer than $\min(2^\lambda,\beth_2)$ rich models of cardinality $\lambda(\lambda > |T|)$ is totally transcendental. We show that a countable theory with a unique rich model in some uncountable cardinal is categorical in ℵ 1 and also has a unique countable rich model. We also (...) consider a stronger notion of richness, and use it to characterize superstable theories. (shrink)

The lambda calculus is a universal programming language. It can represent the computable functions, and such offers a formal counterpart to the point of view of functions as rules. Terms represent functions and this allows for the application of a term/function to any other term/function, including itself. The calculus can be seen as a formal theory with certain pre-established axioms and inference rules, which can be interpreted by models. Dana Scott proposed the first non-trivial model of the extensional (...) lambda calculus, known as $ D_{\infty }$, to represent the $\lambda $-terms as the typical functions of set theory, where it is not allowed to apply a function to itself. Here we propose a construction of an $\infty $-groupoid from any lambda model endowed with a topology. We apply this construction for the particular case $D_{\infty }$, and we see that the Scott topology does not provide enough information about the relationship between higher homotopies. This motivates a new line of research focused on the exploration of $\lambda $-models with the structure of a non-trivial $\infty $-groupoid to generalize the proofs of term conversion to higher-proofs in $\lambda $-calculus. (shrink)

Pokazujemy, że kosmologia współczesna posiada cechy efektywnej teorii fizycznej podobnej do standardowego modelu cząstek elementarnych. Obecnie mamy do czynienia z konstytuowaniem się tzw. standardowego modelu kosmologicznego. W pracy wskazujemy na cechy charakterystyczne takiego modelu, który jest modelem kosmologicznym o maksymalnej symetrii (jednorodność i izotropowość przestrzenna) wypełnionego materią barionową i ciemną materią oraz ciemną energią (ze stałą kosmologiczną). Model ten jest nazywany modelem standardowym LCDM (Lambda - Cold - Dark Matter model) i jest rozwiązaniem klasycznych równań Einsteina z (...) członem kosmologicznym.Proces wyłonienia się modelu LCDM z modelu CDM można traktować jako proces emer- gencji epistemologicznej. Wskazujemy na dwa użyteczne pojęcia: bifurkacji i strukturalnej niestabilności, które mogą być użyteczne w konceptualizacji predykatu nowy, w opisie pojęcia emergencji standardowego modelu kosmologicznego. Na marginesie naszych rozważań formułujemy koncepcję bifurkacyjnego rozwoju kosmologii w drodze kolejnej bifurkacji jej parametrów. Wówczas przejście od modelu dynamicznego CDM do modelu LCDM posiada charakter bifurkacji typu widłowego. Ten scenariusz jest zgodny ze scenariuszem nieliniowego rozwoju nauki Michała Hellera. (shrink)

In this paper we study the logic $\mathcal{L}^\lambda_{\omega\omega}$, which is first-order logic extended by quantification over functions . We give the syntax of the logic as well as the semantics in Heyting categories with exponentials. Embedding the generic model of a theory into a Grothendieck topos yields completeness of $\mathcal{L}^\lambda_{\omega\omega}$ with respect to models in Grothendieck toposes, which can be sharpened to completeness with respect to Heyting-valued models. The logic $\mathcal{L}^\lambda_{\omega\omega}$ is the strongest for which Heyting-valued completeness is known. (...) Finally, we relate the logic to locally connected geometric morphisms between toposes. (shrink)

In standard model theory, deductions are not the things one models. But in general proof theory, in particular in categorial proof theory, one finds models of deductions, and the purpose here is to motivate a simple example of such models. This will be a model of deductions performed within an abstract context, where we do not have any particular logical constant, but something underlying all logical constants. In this context, deductions are represented by arrows in categories involved in (...) a general adjoint situation. To motivate the notion of adjointness, one of the central notions of category theory, and of mathematics in general, it is first considered how some features of it occur in set-theoretical axioms and in the axioms of the lambda calculus. Next, it is explained how this notion arises in the context of deduction, where it characterizes logical constants. It is shown also how the categorial point of view suggests an analysis of propositional identity. The problem of propositional identity, i.e., the problem of identity of meaning for propositions, is no doubt a philosophical problem, but the spirit of the analysis proposed here will be rather mathematical. Finally, it is considered whether models of deductions can pretend to be a semantics. This question, which as so many questions having to do with meaning brings us to that wall that blocked linguists and philosophers during the whole of the twentieth century, is merely posed. At the very end, there is the example of a geometrical model of adjunction. Without pretending that it is a semantics, it is hoped that this model may prove illuminating and useful. (shrink)

There are many results in the literature where superstablity-like independence notions, without any categoricity assumptions, have been used to show the existence of larger models. In this paper we show that stability is enough to construct larger models for small cardinals assuming a mild locality condition for Galois types. Theorem 0.1. Suppose $\lambda <2^{\aleph _0}$. Let ${\mathbf {K}}$ be an abstract elementary class with $\lambda \geq {\operatorname {LS}}({\mathbf {K}})$. Assume ${\mathbf {K}}$ has amalgamation in $\lambda $, no (...) maximal model in $\lambda $, and is stable in $\lambda $. If ${\mathbf {K}}$ is $(<\lambda ^+, \lambda )$ -local, then ${\mathbf {K}}$ has a model of cardinality $\lambda ^{++}$. The set theoretic assumption that $\lambda <2^{\aleph _0}$ and model theoretic assumption of stability in $\lambda $ can be weakened to the model theoretic assumptions that $|{\mathbf {S}}^{na}(M)|< 2^{\aleph _0}$ for every $M \in {\mathbf {K}}_\lambda $ and stability for $\lambda $ -algebraic types in $\lambda $. This is a significant improvement of Theorem 0.1, as the result holds on some unstable abstract elementary classes. (shrink)

Basic results on the model theory of substructures of a fixed model are presented. The main point is to avoid the use of the compactness theorem, so this work can easily be applied to the model theory of L ω 1 ,ω and its relatives. Among other things we prove the following theorem: Let M be a model, and let λ be a cardinal satisfying λ |L(M)| = λ. If M does not have the ω-order property, (...) then for every $A \subseteq M, |A| \leq \lambda$ , and every $\mathbf{I} \subseteq M$ of cardinality λ + there exists $\mathbf{J} \subseteq \mathbf{I}$ of cardinality λ + which is an indiscernible set over A. This is an improvement of a result of S. Shelah. (shrink)

In the paper we show that modern cosmology has a status of effective theory of the Universe similarly to the standard models in particle physics. We illustrate that the source of such a point of view is the fact that the complete theory of the Universe (TOE) should be complicated enough to derive observables. The role of epistemological emergence in the context of cosmological models (Cold Dark Matter vs. Lambda Cold Dark Matter) is also investigated. We demonstrate that while (...) the effective theories of the Universe are not conceptually simple and elegant, their strength lies in the predictive accuracy and data fitting required for the model testing. (shrink)

We present the model construction technique called Linear Realizability. It consists in building a category of Partial Equivalence Relations over a Linear Combinatory Algebra. We illustrate how it can be used to provide models, which are fully complete for various typed λ-calculi. In particular, we focus on special Linear Combinatory Algebras of partial involutions, and we present PER models over them which are fully complete, inter alia, w.r.t. the following languages and theories: the fragment of System F consisting of (...) ML-types, the maximal theory on the simply typed λ-calculus with finitely many ground constants, and the maximal theory on an infinitary version of this latter calculus. (shrink)