Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "completeness" wg kryterium: Temat

  Lista filtrów

Dostawca treści

Wyrównaj
Wyświetlanie 1-25 z 59
Tytuł:
On the completeness of decomposable properties of graphs
Autorzy:
Hałuszczak, Mariusz
Vateha, Pavol
Powiązania:
https://bibliotekanauki.pl/articles/744156.pdf
Data publikacji:
1999
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
decomposition
hereditary property
completeness
Opis:
Let ₁,₂ be additive hereditary properties of graphs. A (₁,₂)-decomposition of a graph G is a partition of E(G) into sets E₁, E₂ such that induced subgraph $G[E_i]$ has the property $_i$, i = 1,2. Let us define a property ₁⊕₂ by {G: G has a (₁,₂)-decomposition}.
A property D is said to be decomposable if there exists nontrivial additive hereditary properties ₁, ₂ such that D = ₁⊕₂. In this paper we determine the completeness of some decomposable properties and we characterize the decomposable properties of completeness 2.
Źródło:
Discussiones Mathematicae Graph Theory; 1999, 19, 2; 229-236
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Pointwise completeness and pointwise degeneracy of 2D standard and positive Fornasini-Marchesini models with state-feedbacks
Autorzy:
Kaczorek, T.
Powiązania:
https://bibliotekanauki.pl/articles/205641.pdf
Data publikacji:
2011
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
pointwise completeness
standard
state-feedbacks
Opis:
Necessary and sufficient conditions are established for the pointwise completeness of 2D standard and positive Fornasini-Marchesini models with state-feedbacks. Similar relations are obtained for the pointwise degeneracy of the 2D models with state-feedbacks. It is shown that if the positive 2D model is pointwise complete then there exists a gain matrix of the state-feedback such that the closed-loop system is pointwise degenerated if both matrices B1 and B2 of the 2D Fornasini-Marchesini model are nonzero. The considerations are illustrated by numerical examples.
Źródło:
Control and Cybernetics; 2011, 40, 1; 39-58
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The pragmatics of casual dialogue
Autorzy:
Warchala, Jacek
Powiązania:
https://bibliotekanauki.pl/articles/468274.pdf
Data publikacji:
2015
Wydawca:
Wydawnictwo Uniwersytetu Śląskiego
Tematy:
casual dialogue
coherence
completeness
extralinguistic factors
Opis:
In this paper, the author presents the relationships of dialogue and then characterizes dialogue as a text. In dialogue’s characteristics, it is necessary to distinguish its units and both obligatory and optional elements. The author notes that a lively and spontaneous dialogue is dependent on various extralinguistic factors as well as accident.
Źródło:
Forum Lingwistyczne; 2015, 2; 97-119
2449-9587
2450-2758
Pojawia się w:
Forum Lingwistyczne
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The pointwise completeness and the pointwise degeneracy of fractional descriptor discrete-time linear systems
Autorzy:
Kaczorek, T.
Powiązania:
https://bibliotekanauki.pl/articles/200344.pdf
Data publikacji:
2019
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
fractional
descriptor
pointwise completeness
pointwise degeneracy
Opis:
The Drazin inverse of matrices is applied to analysis of the pointwise completeness and of the pointwise degeneracy of the fractional descriptor linear discrete-time systems. Necessary and sufficient conditions for the pointwise completeness and the pointwise degeneracy of the fractional descriptor linear discrete-time systems are established. It is shown that every fractional descriptor linear discrete-time systems is not pointwise complete and it is pointwise degenerated in one step (for i= 1).
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2019, 67, 6; 989-993
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Carathéodory completeness on the plane
Autorzy:
Edigarian, Armen
Powiązania:
https://bibliotekanauki.pl/articles/2188102.pdf
Data publikacji:
2019
Wydawca:
Uniwersytet Jagielloński. Wydawnictwo Uniwersytetu Jagiellońskiego
Tematy:
Carathéodory distance
completeness
Melnikov's theorem
peak function
Opis:
M. A. Selby [8-10] and, independently, N. Sibony [11] proved that on the complex plane c-completeness is equivalent to c-finitely compactness. Their proofs are quite similar and are based on [4]. We give more refined equivalent conditions and, along the way, simplify the proofs.
Źródło:
Universitatis Iagellonicae Acta Mathematica; 2019, 56; 15-21
2084-3828
0083-4386
Pojawia się w:
Universitatis Iagellonicae Acta Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
NP-completeness of weakly convex and convex dominating set decision problems
Autorzy:
Raczek, J.
Powiązania:
https://bibliotekanauki.pl/articles/2050778.pdf
Data publikacji:
2004
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
dominating set
NP-completeness
distance
convex set
Opis:
The convex domination number and the weakly convex domination number are new domination parameters. In this paper we show that the decision problems of convex and weakly convex dominating sets are NP-complete for bipartite and split graphs. Using a modified version of Warshall algorithm we can verify in polynomial time whether a given subset of vertices of a graph is convex or weakly convex.
Źródło:
Opuscula Mathematica; 2004, 24, 2; 189-196
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Regularity, pointwise completeness and pointwise generacy of descriptor linear electrical circuits
Autorzy:
Kaczorek, T.
Powiązania:
https://bibliotekanauki.pl/articles/377430.pdf
Data publikacji:
2014
Wydawca:
Politechnika Poznańska. Wydawnictwo Politechniki Poznańskiej
Tematy:
regularity
pointwise completeness
pointwise generacy
descriptor electrical circuits
Opis:
The regularity, pointwise completeness and pointwise generacy of descriptor linear electrical circuits composed of resistances, capacitances, inductances and voltage (current) sources are addressed. It is shown that every descriptor electrical circuit is a linear system with regular pencil. Conditions for the pointwise completeness and pointwise generacy of the descriptor linear electrical circuits are established. The considerations are illustrated by examples of descriptor electrical circuits.
Źródło:
Poznan University of Technology Academic Journals. Electrical Engineering; 2014, 77; 9-28
1897-0737
Pojawia się w:
Poznan University of Technology Academic Journals. Electrical Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Balanced problems on graphs with categorization of edges
Autorzy:
Berežný, Štefan
Lacko, Vladimír
Powiązania:
https://bibliotekanauki.pl/articles/743374.pdf
Data publikacji:
2003
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
algorithms on graphs
categorization of edges
NP-completeness
Opis:
Suppose a graph G = (V,E) with edge weights w(e) and edges partitioned into disjoint categories S₁,...,Sₚ is given. We consider optimization problems on G defined by a family of feasible sets (G) and the following objective function:
$L₅(D) = max_{1≤i≤p} (max_{e ∈ S_i ∩ D} w(e) - min_{e ∈ S_i ∩ D} w(e))$
For an arbitrary number of categories we show that the L₅-perfect matching, L₅-a-b path, L₅-spanning tree problems and L₅-Hamilton cycle (on a Halin graph) problem are NP-complete.
We also summarize polynomiality results concerning above objective functions for arbitrary and for fixed number of categories.
Źródło:
Discussiones Mathematicae Graph Theory; 2003, 23, 1; 5-21
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On some properties of Musielak-Orlicz sequence spaces
Autorzy:
Shragin, Isaac V.
Powiązania:
https://bibliotekanauki.pl/articles/745761.pdf
Data publikacji:
2008
Wydawca:
Polskie Towarzystwo Matematyczne
Tematy:
normal pregenfunction
Musielak-Orlicz sequence space
completeness
separability
Opis:
We consider a nontrivial vector space \(X\) and a semimodular \(M\colon X\tp [0, \infty]\) with property: \((\forall\ x \in X) (\exists\ \alpha \gt 0)\ M (\alphax) \lt \infty\) (in other words, \(M\) is normal (i.e. \((\forall\ x\in X \setminus \{0\}) (\exists \alpha \gt 0)\ M (\alphax) \gt 0)\) pregenfunction). The function \(M\) generates in \(X\) a metric \(d\) with \[ d(x, y) := inf \{a \gt 0: M (a^{-1} (x-y)) \leq a\}. \] At the same time \(M\) generates a metric \(\rho\) in Musielak-Orlicz sequence space \(l_M\), namely \[ \rho(\varphi, \psi) := inf \{a \gt 0 : I(a^{-1} (\varphi - \psi)) \leq a\} \] with \(I(\varphi) = \sum_{n \geq 1} M (\varphiφ(n))\). It is proved that the space \((l_M,\rho)\) is complete if and only if the space \((X, d)\) is complete. We consider also the closed subspace \(G_M \subset l_M\) of sequences \(\varphi = \{\varphi(n)\}\) such that \((\forall \alpha \gt 0) (\exists m \in N) \sum_{n\geq m} M(\alpha\varphi(n)) \lt \infty\) and prove that \((G_M ,\rho)\) is separable if and only if \((X, d)\) is the same. Several examples are considered.
Źródło:
Commentationes Mathematicae; 2008, 48, 2
0373-8299
Pojawia się w:
Commentationes Mathematicae
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Pointwise completeness and pointwise degeneracy of linear continuous-time fractional order systems
Autorzy:
Kaczorek, T.
Busłowicz, M.
Powiązania:
https://bibliotekanauki.pl/articles/384856.pdf
Data publikacji:
2009
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
linear system
fractional
continuous-time
positive
pointwise completeness
Opis:
A dynamical system described by homogeneous equation is called pointwise complete if every final state can be reached by suitable choice of the initial state. The system which is not pointwise complete is called pointwise degenerated. Definitions and necessary and sufficient conditions for the pointwise completeness and the pointwise degeneracy of continuous-time linear systems of fractional order, standard and positive, are given. It is shown that: 1) the standard fractional system is always pointwise complete; 2) the positive fractional system is pointwise complete if and only if the state matrix is diagonal.
Źródło:
Journal of Automation Mobile Robotics and Intelligent Systems; 2009, 3, 1; 8-11
1897-8649
2080-2145
Pojawia się w:
Journal of Automation Mobile Robotics and Intelligent Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Analysis of the regularity, pointwise completeness and pointwise generacy of descriptor linear electrical circuits
Autorzy:
Kaczorek, T.
Powiązania:
https://bibliotekanauki.pl/articles/97423.pdf
Data publikacji:
2014
Wydawca:
Politechnika Poznańska. Wydawnictwo Politechniki Poznańskiej
Tematy:
regularity
pointwise completeness
pointwise generacy
descriptor electrical circuits
Opis:
A method for analysis of the regularity, pointwise completeness and pointwise generacy of descriptor linear electrical circuits composed of resistances, capacitances, inductances and voltage (current) sources is proposed. It is shown that every descriptor electrical circuit is a linear system with regular pencil. Conditions for the pointwise completeness and pointwise generacy of the descriptor linear electrical circuits are established. The considerations are illustrated by examples of descriptor electrical circuits.
Źródło:
Computer Applications in Electrical Engineering; 2014, 12; 1-20
1508-4248
Pojawia się w:
Computer Applications in Electrical Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Iterated neighborhood graphs
Autorzy:
Sonntag, Martin
Teichert, Hanns-Martin
Powiązania:
https://bibliotekanauki.pl/articles/743216.pdf
Data publikacji:
2012
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
neighborhood graph
2-step graph
neighborhood completeness number
Opis:
The neighborhood graph N(G) of a simple undirected graph G = (V,E) is the graph $(V,E_N)$ where $E_N$ = {{a,b} | a ≠ b, {x,a} ∈ E and {x,b} ∈ E for some x ∈ V}. It is well-known that the neighborhood graph N(G) is connected if and only if the graph G is connected and non-bipartite.
We present some results concerning the k-iterated neighborhood graph $N^k(G) : = N(N(...N(G)))$ of G. In particular we investigate conditions for G and k such that $N^k(G)$ becomes a complete graph.
Źródło:
Discussiones Mathematicae Graph Theory; 2012, 32, 3; 403-417
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Pointwise completeness and pointwise degeneracy of standard and positive linear systems with state-feedbacks
Autorzy:
Kaczorek, T.
Powiązania:
https://bibliotekanauki.pl/articles/384546.pdf
Data publikacji:
2010
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
pointwise completeness
pointwise degeneracy
positive linear systems
state-feedbacks
Opis:
The pointwise completeness and pointwise degeneracy of standard and positive linear discrete-time and continuous- time systems with state-feedbacks are addressed. It is shown that: 1) the pointwise completeness and pointwise degeneracy of continuous-time standard systems are invariant under the state and output feedbacks, 2) for standard and positive discrete-time and positive continuous- time systems necessary and sufficient conditions are established for the existence of gain matrices of statefeedbacks such that the closed-loop systems are pointwise complete. Considerations are illustrated by numerical examples.
Źródło:
Journal of Automation Mobile Robotics and Intelligent Systems; 2010, 4, 1; 3-7
1897-8649
2080-2145
Pojawia się w:
Journal of Automation Mobile Robotics and Intelligent Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Pointwise completeness and pointwise degeneracy of standard and positive hybrid linear systems described by the general model
Autorzy:
Kaczorek, T.
Powiązania:
https://bibliotekanauki.pl/articles/229797.pdf
Data publikacji:
2010
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
pointwise completeness
degeneracy
standard
positive
general model
hybrid systems
Opis:
Necessary and sufficient conditions for the pointwise completeness and pointwise degeneracy of the standard and positive hybrid linear systems described by the general model are established. It is shown that the standard general model is always pointwise complete and it is not pointwise degenerated and the positive general model is pointwise complete if and only if its matrix A2 is diagonal.
Źródło:
Archives of Control Sciences; 2010, 20, 2; 123-131
1230-2384
Pojawia się w:
Archives of Control Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Completeness, Categoricity and Imaginary Numbers: The Debate on Husserl
Autorzy:
Aranda, Víctor
Powiązania:
https://bibliotekanauki.pl/articles/750024.pdf
Data publikacji:
2020
Wydawca:
Uniwersytet Łódzki. Wydawnictwo Uniwersytetu Łódzkiego
Tematy:
Husserl
completeness
categoricity
relative and absolute definiteness
imaginary numbers
Opis:
Husserl's two notions of "definiteness" enabled him to clarify the problem of imaginary numbers. The exact meaning of these notions is a topic of much controversy. A "definite" axiom system has been interpreted as a syntactically complete theory, and also as a categorical one. I discuss whether and how far these readings manage to capture Husserl's goal of elucidating the problem of imaginary numbers, raising objections to both positions. Then, I suggest an interpretation of "absolute definiteness" as semantic completeness and argue that this notion does not suffice to explain Husserl's solution to the problem of imaginary numbers.
Źródło:
Bulletin of the Section of Logic; 2020, 49, 2
0138-0680
2449-836X
Pojawia się w:
Bulletin of the Section of Logic
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Problems remaining NP-complete for sparse or dense graphs
Autorzy:
Schiermeyer, Ingo
Powiązania:
https://bibliotekanauki.pl/articles/972006.pdf
Data publikacji:
1995
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
Computational Complexity
NP-Completeness
Hamiltonian Circuit
Hamiltonian Path
Independent Set
Opis:
For each fixed pair α,c > 0 let INDEPENDENT SET ($m ≤ cn^α$) and INDEPENDENT SET ($m ≥ (ⁿ₂) - cn^α$) be the problem INDEPENDENT SET restricted to graphs on n vertices with $m ≤ cn^α$ or $m ≥ (ⁿ₂) - cn^α$ edges, respectively. Analogously, HAMILTONIAN CIRCUIT ($m ≤ n + cn^α$) and HAMILTONIAN PATH ($m ≤ n + cn^α$) are the problems HAMILTONIAN CIRCUIT and HAMILTONIAN PATH restricted to graphs with $m ≤ n + cn^α$ edges. For each ϵ > 0 let HAMILTONIAN CIRCUIT (m ≥ (1 - ϵ)(ⁿ₂)) and HAMILTONIAN PATH (m ≥ (1 - ϵ)(ⁿ₂)) be the problems HAMILTONIAN CIRCUIT and HAMILTONIAN PATH restricted to graphs with m ≥ (1 - ϵ)(ⁿ₂) edges.
We prove that these six restricted problems remain NP-complete. Finally, we consider sufficient conditions for a graph to have a Hamiltonian circuit. These conditions are based on degree sums and neighborhood unions of independent vertices, respectively. Lowering the required bounds the problem HAMILTONIAN CIRCUIT jumps from 'easy' to 'NP-complete'.
Źródło:
Discussiones Mathematicae Graph Theory; 1995, 15, 1; 33-41
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A Note on Polynomial Algorithm for Cost Coloring of Bipartite Graphs with Δ ≤ 4
Autorzy:
Giaro, Krzysztof
Kubale, Marek
Powiązania:
https://bibliotekanauki.pl/articles/31526308.pdf
Data publikacji:
2020-08-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
bipartite graph
chromatic sum
cost coloring
NP-completeness
polynomial algorithm
Opis:
In the note we consider vertex coloring of a graph in which each color has an associated cost which is incurred each time the color is assigned to a vertex. The cost of coloring is the sum of costs incurred at each vertex. We show that the minimum cost coloring problem for n-vertex bipartite graph of degree Δ ≤ 4 can be solved in O(n2) time. This extends Jansen’s result [K. Jansen, The optimum cost chromatic partition problem, in: Proc. CIAC’97, Lecture Notes in Comput. Sci. 1203 (1997) 25–36] for paths and cycles to subgraphs of biquartic graphs.
Źródło:
Discussiones Mathematicae Graph Theory; 2020, 40, 3; 885-891
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Efficient list cost coloring of vertices and/or edges of bounded cyclicity graphs
Autorzy:
Giaro, Krzysztof
Kubale, Marek
Powiązania:
https://bibliotekanauki.pl/articles/744404.pdf
Data publikacji:
2009
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
cost coloring
dynamic programming
list coloring
NP-completeness
polynomial-time algorithm
Opis:
We consider a list cost coloring of vertices and edges in the model of vertex, edge, total and pseudototal coloring of graphs. We use a dynamic programming approach to derive polynomial-time algorithms for solving the above problems for trees. Then we generalize this approach to arbitrary graphs with bounded cyclomatic numbers and to their multicolorings.
Źródło:
Discussiones Mathematicae Graph Theory; 2009, 29, 2; 361-376
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An Arithmetically Complete Predicate Modal Logic
Autorzy:
Hao, Yunge
Tourlakis, George
Powiązania:
https://bibliotekanauki.pl/articles/2033850.pdf
Data publikacji:
2021-08-23
Wydawca:
Uniwersytet Łódzki. Wydawnictwo Uniwersytetu Łódzkiego
Tematy:
Predicate modal logic
arithmetic completeness
logic GL
Solovay's theorem
equational proofs
Opis:
This paper investigates a first-order extension of GL called \(\textup{ML}^3\). We outline briefly the history that led to \(\textup{ML}^3\), its key properties and some of its toolbox: the \emph{conservation theorem}, its cut-free Gentzenisation, the ``formulators'' tool. Its semantic completeness (with respect to finite reverse well-founded Kripke models) is fully stated in the current paper and the proof is retold here. Applying the Solovay technique to those models the present paper establishes its main result, namely, that \(\textup{ML}^3\) is arithmetically complete. As expanded below, \(\textup{ML}^3\) is a first-order modal logic that along with its built-in ability to simulate general classical first-order provability―"\(\Box\)" simulating the the informal classical "\(\vdash\)"―is also arithmetically complete in the Solovay sense.
Źródło:
Bulletin of the Section of Logic; 2021, 50, 4; 513-541
0138-0680
2449-836X
Pojawia się w:
Bulletin of the Section of Logic
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A Post-style proof of completeness theorem for symmetric relatedness Logic S
Autorzy:
Klonowski, Mateusz
Powiązania:
https://bibliotekanauki.pl/articles/749984.pdf
Data publikacji:
2018
Wydawca:
Uniwersytet Łódzki. Wydawnictwo Uniwersytetu Łódzkiego
Tematy:
normal forms
Post-style proof of completeness
relatedness logic
relating logic
Opis:
One of the logic defined by Richard Epstein in a context of an analysis of subject matter relationship is Symmetric Relatedness Logic S. In the monograph [2] we can find some open problems concerning relatedness logic, a Post-style completeness theorem for logic S is one of them. Our paper introduces a solution of this metalogical issue.
Źródło:
Bulletin of the Section of Logic; 2018, 47, 3
0138-0680
2449-836X
Pojawia się w:
Bulletin of the Section of Logic
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Topological and Multi-Topological Frames in the Context of Intuitionistic Modal Logic
Autorzy:
Witczak, Tomasz
Powiązania:
https://bibliotekanauki.pl/articles/749992.pdf
Data publikacji:
2019
Wydawca:
Uniwersytet Łódzki. Wydawnictwo Uniwersytetu Łódzkiego
Tematy:
intuitionistic modal logic
neighbourhood semantics
topological semantics
Kripke frames
soundness and completeness
Opis:
We present three examples of topological semantics for intuitionistic modal logic with one modal operator □. We show that it is possible to treat neighborhood models, introduced earlier, as topological or multi-topological. From the neighborhood point of view, our method is based on differences between properties of minimal and maximal neighborhoods. Also we propose transformation of multitopological spaces into the neighborhood structures.
Źródło:
Bulletin of the Section of Logic; 2019, 48, 3; 187-205
0138-0680
2449-836X
Pojawia się w:
Bulletin of the Section of Logic
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Isomorphisms of direct products of lattice-ordered groups
Autorzy:
Jakubík, Ján
Powiązania:
https://bibliotekanauki.pl/articles/728908.pdf
Data publikacji:
2004
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
Lattice-ordered group
direct product
Specker lattice-ordered group
orthogonal σ-completeness
Opis:
In this paper we investigate sufficient conditions for the validity of certain implications concerning direct products of lattice-ordered groups.
Źródło:
Discussiones Mathematicae - General Algebra and Applications; 2004, 24, 1; 43-52
1509-9415
Pojawia się w:
Discussiones Mathematicae - General Algebra and Applications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Koncepcja androgyna w utworze Mój księżycowy przyjaciel (Мой лунный друг) Zinaidy Gippius
The concept of androgyny in Zinaida Gippius’s My moon friend
Autorzy:
Okroj, Kinga
Powiązania:
https://bibliotekanauki.pl/articles/460081.pdf
Data publikacji:
2016
Wydawca:
Fundacja Pro Scientia Publica
Tematy:
Błok, Gippius, modernizm, androgyne, pełnia, doskonałość
Blok, Gippius, modernism, androgyny, completeness, perfection
Opis:
The article comprises an analysis of My moon friend by the modernist Russian poet and diarist, Zinaida Gippius. Vladimir Solovyov’s theories about the possibility to create a new human (androgyny) as well as Otto Weininger’s ideas about bisexual nature of every human being serve as a starting point for the analysis. The author focuses on the image of the protagonist, the Russian poet Alexander Blok, and sees him as the eponymous moon friend, who possesses features typical of androgynous creatures.
Celem niniejszego artykułu jest analiza utworu Mój księżycowy przyjaciel (Мой лунный друг) pióra poetki i diarystki epoki modernizmu Zinaidy Gippius. Punktem wyjścia artykułu jest teoria Włodzimierza Sołowjowa o możliwości stworzenia doskonałego człowieka przyszłości (androgyna) oraz myśl Otto Weiningera, mówiąca o biseksualnej naturze każdego człowieka. Artykuł jest próbą zinterpretowania obrazu bohatera utworu Mój księżycowy przyjaciel, poety Aleksandra Błoka, jako tytułowej „księżycowej” postaci, czyli takiej, która wyróżnia się cechami charakterystycznymi dla istoty androgynicznej.
Źródło:
Ogrody Nauk i Sztuk; 2016, 6; 451-457
2084-1426
Pojawia się w:
Ogrody Nauk i Sztuk
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Identity, Equality, Nameability and Completeness
Autorzy:
Manzano, María
Moreno, Manuel Crescencio
Powiązania:
https://bibliotekanauki.pl/articles/750030.pdf
Data publikacji:
2017
Wydawca:
Uniwersytet Łódzki. Wydawnictwo Uniwersytetu Łódzkiego
Tematy:
first-order logic
type theory
identity
equality
indiscernibility
comprehension
completeness
translations
nameability
Opis:
This article is an extended promenade strolling along the winding roads of identity, equality, nameability and completeness, looking for places where they converge. We have distinguished between identity and equality; the first is a binary relation between objects while the second is a symbolic relation between terms. Owing to the central role the notion of identity plays in logic, you can be interested either in how to define it using other logical concepts or in the opposite scheme. In the first case, one investigates what kind of logic is required. In the second case, one is interested in the definition of the other logical concepts (connectives and quantifiers) in terms of the identity relation, using also abstraction. The present paper investigates whether identity can be introduced by definition arriving to the conclusion that only in full higher-order logic a reliable definition of identity is possible. However, the definition needs the standard semantics and we know that with this semantics completeness is lost. We have also studied the relationship of equality with comprehension and extensionality and pointed out the relevant role played by these two axioms in Henkin’s completeness method. We finish our paper with a section devoted to general semantics, where the role played by the nameable hierarchy of types is the key in Henkin’s completeness method.
Źródło:
Bulletin of the Section of Logic; 2017, 46, 3/4
0138-0680
2449-836X
Pojawia się w:
Bulletin of the Section of Logic
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On Incidence Coloring of Complete Multipartite and Semicubic Bipartite Graphs
Autorzy:
Janczewski, Robert
Małafiejski, Michał
Małafiejska, Anna
Powiązania:
https://bibliotekanauki.pl/articles/31342434.pdf
Data publikacji:
2018-02-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
incidence coloring
complete multipartite graphs
semicubic graphs
subcubic graphs
-completeness
L (1,1)-labelling
Opis:
In the paper, we show that the incidence chromatic number $ \chi_i $ of a complete $k$-partite graph is at most $ \Delta + 2 $ (i.e., proving the incidence coloring conjecture for these graphs) and it is equal to $ \Delta + 1 $ if and only if the smallest part has only one vertex (i.e., $ \Delta = n − 1 $). Formally, for a complete k-partite graph $ G = K_{r_1,r_2,...,r_k} $ with the size of the smallest part equal to $ r_1 \ge 1 $ we have $$ \chi_i (G)= \begin{cases} \Delta(G)+1 & \text { if } r_1=1, \\ \Delta(G)+2 & \text { if } r_1>1. \end{cases} $$ In the paper we prove that the incidence 4-coloring problem for semicubic bipartite graphs is \( \mathcal{NP} \)-complete, thus we prove also the \( \mathcal{NP} \)-completeness of L(1, 1)-labeling problem for semicubic bipartite graphs. Moreover, we observe that the incidence 4-coloring problem is \( \mathcal{NP} \)-complete for cubic graphs, which was proved in the paper [12] (in terms of generalized dominating sets).
Źródło:
Discussiones Mathematicae Graph Theory; 2018, 38, 1; 107-119
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-25 z 59

Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies