Measurable Process Selection Theorem and Non-autonomous Inclusions

Jorge E. Cardona; Lev Kapitanski

doi:10.1007/978-3-030-31041-7_23

Measurable Process Selection Theorem and Non-autonomous Inclusions

Jorge E. Cardona, Lev Kapitanski

Mathematics

Research output: Chapter in Book/Report/Conference proceeding › Chapter

Abstract

A semi-process is an analog of the semi-flow for non-autonomous differential equations or inclusions. We prove an abstract result on the existence of measurable semi-processes in the situations where there is no uniqueness. Also, we allow solutions to blow up in finite time and then obtain local semi-processes.

Original language	English (US)
Title of host publication	Studies in Computational Intelligence
Publisher	Springer
Pages	413-428
Number of pages	16
DOIs	https://doi.org/10.1007/978-3-030-31041-7_23
State	Published - Jan 1 2020

Publication series

Name	Studies in Computational Intelligence
Volume	835
ISSN (Print)	1860-949X
ISSN (Electronic)	1860-9503

ASJC Scopus subject areas

Artificial Intelligence

Access to Document

10.1007/978-3-030-31041-7_23

Fingerprint Dive into the research topics of 'Measurable Process Selection Theorem and Non-autonomous Inclusions'. Together they form a unique fingerprint.

Cite this

Cardona, J. E., & Kapitanski, L. (2020). Measurable Process Selection Theorem and Non-autonomous Inclusions. In Studies in Computational Intelligence (pp. 413-428). (Studies in Computational Intelligence; Vol. 835). Springer. https://doi.org/10.1007/978-3-030-31041-7_23

@inbook{e920610072ca494cbc98d76ddd4d96ce,

title = "Measurable Process Selection Theorem and Non-autonomous Inclusions",

abstract = "A semi-process is an analog of the semi-flow for non-autonomous differential equations or inclusions. We prove an abstract result on the existence of measurable semi-processes in the situations where there is no uniqueness. Also, we allow solutions to blow up in finite time and then obtain local semi-processes.",

author = "Cardona, {Jorge E.} and Lev Kapitanski",

year = "2020",

month = jan,

day = "1",

doi = "10.1007/978-3-030-31041-7_23",

language = "English (US)",

series = "Studies in Computational Intelligence",

publisher = "Springer",

pages = "413--428",

booktitle = "Studies in Computational Intelligence",

}

TY - CHAP

T1 - Measurable Process Selection Theorem and Non-autonomous Inclusions

AU - Cardona, Jorge E.

AU - Kapitanski, Lev

PY - 2020/1/1

Y1 - 2020/1/1

N2 - A semi-process is an analog of the semi-flow for non-autonomous differential equations or inclusions. We prove an abstract result on the existence of measurable semi-processes in the situations where there is no uniqueness. Also, we allow solutions to blow up in finite time and then obtain local semi-processes.

AB - A semi-process is an analog of the semi-flow for non-autonomous differential equations or inclusions. We prove an abstract result on the existence of measurable semi-processes in the situations where there is no uniqueness. Also, we allow solutions to blow up in finite time and then obtain local semi-processes.

UR - http://www.scopus.com/inward/record.url?scp=85080928542&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85080928542&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-31041-7_23

DO - 10.1007/978-3-030-31041-7_23

M3 - Chapter

AN - SCOPUS:85080928542

T3 - Studies in Computational Intelligence

SP - 413

EP - 428

BT - Studies in Computational Intelligence

PB - Springer

ER -