<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <title>DSpace Collection:</title>
  <link rel="alternate" href="http://www.openstarts.units.it:80/dspace/handle/10077/6452" />
  <subtitle />
  <id>http://www.openstarts.units.it:80/dspace/handle/10077/6452</id>
  <updated>2013-05-22T17:47:42Z</updated>
  <dc:date>2013-05-22T17:47:42Z</dc:date>
  <entry>
    <title>Leibniz principle and unlimited formulas. Star concepts</title>
    <link rel="alternate" href="http://www.openstarts.units.it:80/dspace/handle/10077/6464" />
    <author>
      <name>Crisma, Lucio</name>
    </author>
    <author>
      <name>Holzer, Silvano</name>
    </author>
    <id>http://www.openstarts.units.it:80/dspace/handle/10077/6464</id>
    <updated>2012-08-06T07:46:50Z</updated>
    <published>1979-01-01T00:00:00Z</published>
    <summary type="text">Title: Leibniz principle and unlimited formulas. Star concepts; Principio di Liebniz e formule illimitate. Star-concetti
Authors: Crisma, Lucio; Holzer, Silvano
Abstract: Con una opportuna estensione dei monomorfismi si ottiene una trasformazione dei predicati (concetti) che consente di formulare ii principio di Leibniz in forma generalizzata e di agevolare, evitando gravosi problemi di formalizzazione, lo studio dell’analisi non-standard e delle sue applicazioni.; We obtain a transformation of the meta-predicates (concepts) by means of a suitable extension of the monomorphisms. This transformation allows us to derive a useful generalization of Leibniz’s principle and moreover, avoiding heavy formalizations, it tnakes easier the study of the Non-standard Analysis and its applications.
Type: Articolo</summary>
    <dc:date>1979-01-01T00:00:00Z</dc:date>
  </entry>
  <entry>
    <title>Sui sistemi massimali di sottovarietà lineari di particolari varietà intersezione completa</title>
    <link rel="alternate" href="http://www.openstarts.units.it:80/dspace/handle/10077/6463" />
    <author>
      <name>Viola, Paolo</name>
    </author>
    <id>http://www.openstarts.units.it:80/dspace/handle/10077/6463</id>
    <updated>2012-08-06T08:01:57Z</updated>
    <published>1979-01-01T00:00:00Z</published>
    <summary type="text">Title: Sui sistemi massimali di sottovarietà lineari di particolari varietà intersezione completa
Authors: Viola, Paolo
Abstract: Si studiano i sistemi algebrici massimali di sottovarietà lineari dell’intersezione completa di ipersuperfici, singolari in un medesimo punto.; We study the maximal algebraic systems of linear subvarieties of the complete intersection of hypersurfaces, singular in the same point.
Type: Articolo</summary>
    <dc:date>1979-01-01T00:00:00Z</dc:date>
  </entry>
  <entry>
    <title>Relations between K-morphisms and lax algebras</title>
    <link rel="alternate" href="http://www.openstarts.units.it:80/dspace/handle/10077/6462" />
    <author>
      <name>Pedicchio, Maria Cristina</name>
    </author>
    <id>http://www.openstarts.units.it:80/dspace/handle/10077/6462</id>
    <updated>2012-11-09T09:00:26Z</updated>
    <published>1979-01-01T00:00:00Z</published>
    <summary type="text">Title: Relations between K-morphisms and lax algebras; Relazioni tra K-morfismi e lax-algebre
Authors: Pedicchio, Maria Cristina
Abstract: Si costruisce un 2-isomorfismo tra la 2-categoria Pseud (H, K) dei&#xD;
K-morfismi di H in K e la 2-categoria K$^{v\otimes-}$delle lax algebre&#xD;
alla Bunge associate alla lax monade V $\otimes$-.; We define a 2-isomorphism between the 2-category Pseud (H, K) of K-morphisms&#xD;
from H to K and the 2-category K$^{v\otimes-}$of Bunge lax algebras&#xD;
associated to the lax monad V $\otimes$-.
Type: Articolo</summary>
    <dc:date>1979-01-01T00:00:00Z</dc:date>
  </entry>
  <entry>
    <title>Oscillations of n-th order functional-differential equations with perturbations</title>
    <link rel="alternate" href="http://www.openstarts.units.it:80/dspace/handle/10077/6461" />
    <author>
      <name>Chen, Lu San</name>
    </author>
    <author>
      <name>Yeh, Cheh Chih</name>
    </author>
    <id>http://www.openstarts.units.it:80/dspace/handle/10077/6461</id>
    <updated>2012-11-08T14:01:12Z</updated>
    <published>1979-01-01T00:00:00Z</published>
    <summary type="text">Title: Oscillations of n-th order functional-differential equations with perturbations
Authors: Chen, Lu San; Yeh, Cheh Chih
Abstract: Di recente, si è riscontrato un crescente interesse per lo studio&#xD;
dì equazioni differenziali di ordine n in cui figura l'operatore differenziale&#xD;
di ordine n&#xD;
\[&#xD;
L_{0}x(t)=x(t),L_{i}x(t)=\frac{1}{r_{i}(t)}\frac{d}{dt}L_{i-1}x(t),\quad1\leq i\leq n,&#xD;
\]&#xD;
\[&#xD;
r_{n}(t)=1,&#xD;
\]&#xD;
che dà luogo a termini smorzati. In questo lavoro, vengono studiati&#xD;
criteri oscillatori per le soluzioni limitate di equazioni funzionali&#xD;
di ordine n, con argomenti devianti di tipo generale, aventi la forma&#xD;
\[&#xD;
(E)\quad\quad\quad L_{0}x(t)+H(t,x\left[g_{1}(t)\right]),\quad n\quad\quad\textrm{even}&#xD;
\]&#xD;
e vengono date condizioni sufficienti per H e Q, tali da assicurare&#xD;
che tutte le soluzioni limitate di (E) siano oscillatorie.; Recently, there is an increasing interest in studying the n-th arder&#xD;
differential equatìons involving the so called n-th arder r-derivative&#xD;
of x&#xD;
\[&#xD;
L_{0}x(t)=x(t),L_{i}x(t)=\frac{1}{r_{i}(t)}\frac{d}{dt}L_{i-1}x(t),\quad1\leq i\leq n,&#xD;
\]&#xD;
\[&#xD;
r_{n}(t)=1,&#xD;
\]&#xD;
which causes damped terms. Here, are studied the oscillatory criteria&#xD;
of bounded solutions of n-th order functional differential equations&#xD;
with general deviating arguments of the form&#xD;
\[&#xD;
(E)\quad\quad\quad L_{0}x(t)+H(t,x\left[g_{1}(t)\right]),\quad n\quad\quad\textrm{even}&#xD;
\]&#xD;
and are given the sufficient conditions on H and Q, wich guarantee&#xD;
that all bounded solutions of (E) are oscillatory.
Type: Articolo</summary>
    <dc:date>1979-01-01T00:00:00Z</dc:date>
  </entry>
</feed>

