Log in

Relevant bibliographies by topics / Boolean valued models

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers

Academic literature on the topic 'Boolean valued models'

Author: Grafiati

Published: 1 February 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Boolean valued models.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Boolean valued models"

1

Wu, Xinhe. "Boolean-Valued Models and Their Applications." Bulletin of Symbolic Logic 28, no. 4 (2022): 533. http://dx.doi.org/10.1017/bsl.2022.34.

Full text

Abstract:

AbstractBoolean-valued models generalize classical two-valued models by allowing arbitrary complete Boolean algebras as value ranges. The goal of my dissertation is to study Boolean-valued models and explore their philosophical and mathematical applications.In Chapter 1, I build a robust theory of first-order Boolean-valued models that parallels the existing theory of two-valued models. I develop essential model-theoretic notions like “Boolean-valuation,” “diagram,” and “elementary diagram,” and prove a series of theorems on Boolean-valued models, including the (strengthened) Soundness and Com

APA, Harvard, Vancouver, ISO, and other styles

2

Dahn, Bernd I. "Boolean valued models and incomplete specifications." Journal of Logic Programming 12, no. 3 (1992): 225–36. http://dx.doi.org/10.1016/0743-1066(92)90025-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

OZAWA, MASANAO. "ORTHOMODULAR-VALUED MODELS FOR QUANTUM SET THEORY." Review of Symbolic Logic 10, no. 4 (2017): 782–807. http://dx.doi.org/10.1017/s1755020317000120.

Full text

Abstract:

AbstractIn 1981, Takeuti introduced quantum set theory by constructing a model of set theory based on quantum logic represented by the lattice of closed linear subspaces of a Hilbert space in a manner analogous to Boolean-valued models of set theory, and showed that appropriate counterparts of the axioms of Zermelo–Fraenkel set theory with the axiom of choice (ZFC) hold in the model. In this paper, we aim at unifying Takeuti’s model with Boolean-valued models by constructing models based on general complete orthomodular lattices, and generalizing the transfer principle in Boolean-valued models

APA, Harvard, Vancouver, ISO, and other styles

4

Hansen, Lars. "On an algebra of lattice-valued logic." Journal of Symbolic Logic 70, no. 1 (2005): 282–318. http://dx.doi.org/10.2178/jsl/1107298521.

Full text

Abstract:

AbstractThe purpose of this paper is to present an algebraic generalization of the traditional two-valued logic. This involves introducing a theory of automorphism algebras, which is an algebraic theory of many-valued logic having a complete lattice as the set of truth values. Two generalizations of the two-valued case will be considered, viz., the finite chain and the Boolean lattice. In the case of the Boolean lattice, on choosing a designated lattice value, this algebra has binary retracts that have the usual axiomatic theory of the propositional calculus as suitable theory. This suitabilit

APA, Harvard, Vancouver, ISO, and other styles

5

Hernandez, E. G. "Boolean-Valued Models of Set Theory with Automorphisms." Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 32, no. 7-9 (1986): 117–30. http://dx.doi.org/10.1002/malq.19860320704.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Dobrić, Vladimir, Pavle Milošević, Aleksandar Rakićević, Bratislav Petrović, and Ana Poledica. "Interpolative Boolean Networks." Complexity 2017 (2017): 1–15. http://dx.doi.org/10.1155/2017/2647164.

Full text

Abstract:

Boolean networks are used for modeling and analysis of complex systems of interacting entities. Classical Boolean networks are binary and they are relevant for modeling systems with complex switch-like causal interactions. More descriptive power can be provided by the introduction of gradation in this model. If this is accomplished by using conventional fuzzy logics, the generalized model cannot secure the Boolean frame. Consequently, the validity of the model’s dynamics is not secured. The aim of this paper is to present the Boolean consistent generalization of Boolean networks, interpolative

APA, Harvard, Vancouver, ISO, and other styles

7

Butz, C., and I. Moerdijk. "An elementary definability theorem for first order logic." Journal of Symbolic Logic 64, no. 3 (1999): 1028–36. http://dx.doi.org/10.2307/2586617.

Full text

Abstract:

In this paper, we will present a definability theorem for first order logic. This theorem is very easy to state, and its proof only uses elementary tools. To explain the theorem, let us first observe that if M is a model of a theory T in a language , then, clearly, any definable subset S ⊂ M (i.e., a subset S = {a ∣ M ⊨ φ(a)} defined by some formula φ) is invariant under all automorphisms of M. The same is of course true for subsets of Mn defined by formulas with n free variables.Our theorem states that, if one allows Boolean valued models, the converse holds. More precisely, for any theory T

APA, Harvard, Vancouver, ISO, and other styles

8

Molchanov, I. S. "Set-Valued Estimators for Mean Bodies Related to Boolean Models." Statistics 28, no. 1 (1996): 43–56. http://dx.doi.org/10.1080/02331889708802547.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Trinh, Van-Giang, Belaid Benhamou, Thomas Henzinger, and Samuel Pastva. "Trap spaces of multi-valued networks: definition, computation, and applications." Bioinformatics 39, Supplement_1 (2023): i513—i522. http://dx.doi.org/10.1093/bioinformatics/btad262.

Full text

Abstract:

Abstract Motivation Boolean networks are simple but efficient mathematical formalism for modelling complex biological systems. However, having only two levels of activation is sometimes not enough to fully capture the dynamics of real-world biological systems. Hence, the need for multi-valued networks (MVNs), a generalization of Boolean networks. Despite the importance of MVNs for modelling biological systems, only limited progress has been made on developing theories, analysis methods, and tools that can support them. In particular, the recent use of trap spaces in Boolean networks made a gre

APA, Harvard, Vancouver, ISO, and other styles

10

Pantle, Ursa, Volker Schmidt, and Evgueni Spodarev. "Central limit theorems for functionals of stationary germ-grain models." Advances in Applied Probability 38, no. 1 (2006): 76–94. http://dx.doi.org/10.1239/aap/1143936141.

Full text

Abstract:

Conditions are derived for the asymptotic normality of a general class of vector-valued functionals of stationary Boolean models in the d-dimensional Euclidean space, where a Lindeberg-type central limit theorem for m-dependent random fields, m ∈ N, is applied. These functionals can be used to construct joint estimators for the vector of specific intrinsic volumes of the underlying Boolean model. Extensions to functionals of more general germ–grain models satisfying some mixing and integrability conditions are also discussed.

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Boolean valued models"

1

Santiago, Suárez Juan Manuel. "Infinitary logics and forcing." Electronic Thesis or Diss., Université Paris Cité, 2024. http://www.theses.fr/2024UNIP7024.

Full text

Abstract:

Les principaux résultats de cette thèse sont liés au forcing, mais notre présentation bénéficie de sa mise en relation avec un autre domaine de la logique: la théorie des modèles des logiques infinitaires. Une idée clé de notre travail, qui était plus ou moins implicite dans les recherches de nombreux auteurs, est que le forcing joue un rôle en logique infinitaire similaire à celui joué par le théorème de compacité en logique du premier ordre. Plus précisément, de la même manière que le théorème de compacité est l'outil clé pour produire des modèles de théories du premier ordre, le forcing peu

APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Boolean valued models"

1

L, Bell J. Set theory: Boolean-valued models and independence proofs. 3rd ed. Clarendon Press, 2011.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Bell, J. L. Boolean-valued models and independence proofs in set theory. 2nd ed. Clarendon, 1985.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Makkai, Mihály. Models, logics, and higher-dimensional categories: A tribute to the work of Mihaly Makkai. American Mathematical Society, 2011.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

Button, Tim, and Sean Walsh. Boolean-valued structures. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780198790396.003.0013.

Full text

Abstract:

Chapters 6-12 are driven by questions about the ability to pin down mathematical entities and to articulate mathematical concepts. This chapter is driven by similar questions about the ability to pin down the semantic frameworks of language. It transpires that there are not just non-standard models, but non-standard ways of doing model theory itself. In more detail: whilst we normally outline a two-valued semantics which makes sentences True or False in a model, the inference rules for first-order logic are compatible with a four-valued semantics; or a semantics with countably many values; or

APA, Harvard, Vancouver, ISO, and other styles

5

Bell, John L. Set Theory: Boolean-Valued Models and Independence Proofs. Oxford University Press, 2005.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

Bell, John L. Set Theory: Boolean-Valued Models and Independence Proofs. Ebsco Publishing, 2005.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

Boolean-valued models and independence proofs in set theory. 2nd ed. Oxford University Press, 1985.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

Simplified Independence Proofs: Boolean Valued Models of Set Theory. Elsevier Science & Technology Books, 2011.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

Bell, John L. Set Theory: Boolean-Valued Models and Independence Proofs (Oxford Logic Guides). Oxford University Press, USA, 2005.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

10

Geometric Set Theory. American Mathematical Society, 2020.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Boolean valued models"

1

Viale, Matteo. "Boolean Valued Models." In UNITEXT. Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-71660-7_6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Dahn, Bernd I. "Boolean valued models and incomplete specifications." In Algebraic and Logic Programming. Springer Berlin Heidelberg, 1988. http://dx.doi.org/10.1007/3-540-50667-5_63.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Pierobon, Moreno, and Matteo Viale. "Boolean Valued Models, Sheafifications, and Boolean Ultrapowers of Tychonoff Spaces." In Chapman Mathematical Notes. Springer Nature Switzerland, 2024. https://doi.org/10.1007/978-3-031-68934-5_14.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

da Costa, N. C. A., and F. A. Doria. "Structures, Suppes Predicates, and Boolean-Valued Models in Physics." In Philosophical Logic and Logical Philosophy. Springer Netherlands, 1996. http://dx.doi.org/10.1007/978-94-015-8678-8_7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Eckert, Daniel, and Frederik Herzberg. "The Problem of Judgment Aggregation in the Framework of Boolean-Valued Models." In Lecture Notes in Computer Science. Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-09764-0_9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Yang, Jiong, and Kuldeep S. Meel. "Rounding Meets Approximate Model Counting." In Computer Aided Verification. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-37703-7_7.

Full text

Abstract:

AbstractThe problem of model counting, also known as $$\#\textsf{SAT}$$ # SAT , is to compute the number of models or satisfying assignments of a given Boolean formula F. Model counting is a fundamental problem in computer science with a wide range of applications. In recent years, there has been a growing interest in using hashing-based techniques for approximate model counting that provide $$(\varepsilon , \delta )$$ ( ε , δ ) -guarantees: i.e., the count returned is within a $$(1+\varepsilon )$$ ( 1 + ε ) -factor of the exact count with confidence at least $$1-\delta $$ 1 - δ . While hashing-based techniques attain reasonable scalability for large enough values of $$\delta $$ δ , their scalability is severely impacted for smaller values of $$\delta $$ δ , thereby preventing their adoption in application domains that require estimates with high confidence.The primary contribution of this paper is to address the Achilles heel of hashing-based techniques: we propose a novel approach based on rounding that allows us to achieve a significant reduction in runtime for smaller values of $$\delta $$ δ . The resulting counter, called $$\textsf{ApproxMC6}$$ ApproxMC 6 (The resulting tool $$\textsf{ApproxMC6}$$ ApproxMC 6 is available open-source at https://github.com/meelgroup/approxmc), achieves a substantial runtime performance improvement over the current state-of-the-art counter, $$\textsf{ApproxMC}$$ ApproxMC . In particular, our extensive evaluation over a benchmark suite consisting of 1890 instances shows $$\textsf{ApproxMC6}$$ ApproxMC 6 solves 204 more instances than $$\textsf{ApproxMC}$$ ApproxMC , and achieves a $$4\times $$ 4 × speedup over $$\textsf{ApproxMC}$$ ApproxMC .

APA, Harvard, Vancouver, ISO, and other styles

7

Tan, Jianping, Kunpeng Han, Yao Liu, Xiaoxuan Huang, and Erte Lin. "Optimization of Damping Groove Parameters of Swashplate Plunger Pump Based on CATIA Secondary Development." In Lecture Notes in Mechanical Engineering. Springer Nature Singapore, 2025. https://doi.org/10.1007/978-981-97-7887-4_81.

Full text

Abstract:

Abstract In order to improve the performance of the plunger pump, aiming at the problems of flow pulsation and pressure overshoot of the plunger pump, a new compound slot flow distribution buffer tank structure is proposed. CATIA modeling software is used to obtain the overflow area curve of the valve plate through Boolean operation. Through the secondary development of the software, the overflow area curve of the valve plate under different parameter values can be obtained efficiently. Then the pressure, flow and other related parameters of the pump can be observed in the AMESim model of the plunger pump. The results show that the flow pulsation and pressure overshoot can be effectively reduced when the depth Angle is 7°, the width Angle is 90° and the composite aperture is 0.8 mm.

APA, Harvard, Vancouver, ISO, and other styles

8

Damonte, Alessia. "Testing Joint Sufficiency Twice: Explanatory Qualitative Comparative Analysis." In Texts in Quantitative Political Analysis. Springer International Publishing, 2023. http://dx.doi.org/10.1007/978-3-031-12982-7_7.

Full text

Abstract:

AbstractStandard Qualitative Comparative Analysis (QCA) applies an eliminative cross-case algorithm to identify which combinations of factors are logically associated with an outcome in a population. As such, it suits the purpose of pinpointing the conditions under which an outcome occurs or fails. However, the explanatory import of its findings only follows if the algorithm identifies theoretically interpretable, logically valid, and empirically plausible causal compounds.The chapter provides an essential guide to designing an explanatory QCA that meets the three credibility requirements at once. Section 7.2 addresses how to develop starting hypotheses consistent with the assumptions of complex causation to preserve theoretical interpretability. Section 7.3 introduces the Boolean algebra required to model a hypothesis and find which part supports the explanatory claim in the cases at hand. Section 7.4 addresses the issue of gauging conditions to ensure the empirical plausibility of the analysis. Last, Sect. 7.5 summarizes the protocol, illustrated by the replicable example in the online R file.

APA, Harvard, Vancouver, ISO, and other styles

9

"Forcing and Boolean-valued models." In Multiple Forcing. Cambridge University Press, 1987. http://dx.doi.org/10.1017/cbo9780511721168.002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Dahn, Bernd I. "BOOLEAN VALUED MODELS AND INCOMPLETE SPECIFICATIONS." In Algebraic and Logic Programming. De Gruyter, 1988. http://dx.doi.org/10.1515/9783112620267-012.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Boolean valued models"

1

Figallo-Orellano, Aldo, and Juan Sebastián Slagter. "Models for da Costa’s paraconsistent set theory." In Workshop Brasileiro de Lógica. Sociedade Brasileira de Computação - SBC, 2020. http://dx.doi.org/10.5753/wbl.2020.11456.

Full text

Abstract:

In this work we will be constructed F-structures-valued models as generalization of Boolean-valued models and proved that these models that verify Leibniz’ Law validate all the set-theoretic axioms of da Costa’s Paraconsistent Set Theory type ZF.

APA, Harvard, Vancouver, ISO, and other styles

2

Shcherba, E. V. "Boolean-valued models of telecommunication systems in some problems of network security." In 2015 International Siberian Conference on Control and Communications (SIBCON). IEEE, 2015. http://dx.doi.org/10.1109/sibcon.2015.7147292.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Liu, Han, Xiangnan He, Fuli Feng, Liqiang Nie, Rui Liu, and Hanwang Zhang. "Discrete Factorization Machines for Fast Feature-based Recommendation." In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/479.

Full text

Abstract:

User and item features of side information are crucial for accurate recommendation. However, the large number of feature dimensions, e.g., usually larger than 107, results in expensive storage and computational cost. This prohibits fast recommendation especially on mobile applications where the computational resource is very limited. In this paper, we develop a generic feature-based recommendation model, called Discrete Factorization Machine (DFM), for fast and accurate recommendation. DFM binarizes the real-valued model parameters (e.g., float32) of every feature embedding into binary codes (

APA, Harvard, Vancouver, ISO, and other styles

4

Kolb, Samuel, Martin Mladenov, Scott Sanner, Vaishak Belle, and Kristian Kersting. "Efficient Symbolic Integration for Probabilistic Inference." In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/698.

Full text

Abstract:

Weighted model integration (WMI) extends weighted model counting (WMC) to the integration of functions over mixed discrete-continuous probability spaces. It has shown tremendous promise for solving inference problems in graphical models and probabilistic programs. Yet, state-of-the-art tools for WMI are generally limited either by the range of amenable theories, or in terms of performance. To address both limitations, we propose the use of extended algebraic decision diagrams (XADDs) as a compilation language for WMI. Aside from tackling typical WMI problems, XADDs also enable partial WMI yiel

APA, Harvard, Vancouver, ISO, and other styles

5

Bouskela, Daniel, Lena Buffoni, Audrey Jardin, Vince Molnair, Adrian Pop, and Armin Zavada. "The Common Requirement Modeling Language." In 15th International Modelica Conference 2023, Aachen, October 9-11. Linköping University Electronic Press, 2023. http://dx.doi.org/10.3384/ecp204497.

Full text

Abstract:

CRML (the Common Requirement Modeling Language) is a new language for the formal expression of requirements. The ambition is to release the language as an open standard integrated into the open source modeling and simulation tool OpenModelica and interoperable with the open systems engineering standard SysMLv2. CRML allows to express requirements as multidisciplinary spatiotemporal constraints that can be verified against system design by co-simulating requirements models with behavioral models. Particular attention is paid to the following aspects. The requirements models must be easily legib

APA, Harvard, Vancouver, ISO, and other styles

6

de Colnet, Alexis, and Stefan Mengel. "A Compilation of Succinctness Results for Arithmetic Circuits." In 18th International Conference on Principles of Knowledge Representation and Reasoning {KR-2021}. International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/kr.2021/20.

Full text

Abstract:

Arithmetic circuits (AC) are circuits over the real numbers with 0/1-valued input variables whose gates compute the sum or the product of their inputs. Positive AC – that is, AC representing non-negative functions – subsume many interesting probabilistic models such as probabilistic sentential decision diagram (PSDD) or sum-product network (SPN) on indicator variables. Efficient algorithms for many operations useful in probabilistic reasoning on these models critically depend on imposing structural restrictions to the underlying AC. Generally, adding structural restrictions yields new tractabl

APA, Harvard, Vancouver, ISO, and other styles

7

Shcherba, E. V., and M. V. Shcherba. "Finding the Optimal Paths in a Boolean-Valued Network." In 2019 International Multi-Conference on Industrial Engineering and Modern Technologies (FarEastCon). IEEE, 2019. http://dx.doi.org/10.1109/fareastcon.2019.8934413.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Harder, Hans, Simon Jantsch, Christel Baier, and Clemens Dubslaff. "A Unifying Formal Approach to Importance Values in Boolean Functions." In Thirty-Second International Joint Conference on Artificial Intelligence {IJCAI-23}. International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/ijcai.2023/304.

Full text

Abstract:

Boolean functions and their representation through logics, circuits, machine learning classifiers, or binary decision diagrams (BDDs) play a central role in the design and analysis of computing systems. Quantifying the relative impact of variables on the truth value by means of importance values can provide useful insights to steer system design and debugging. In this paper, we introduce a uniform framework for reasoning about such values, relying on a generic notion of importance value functions (IVFs). The class of IVFs is defined by axioms motivated from several notions of importance values

APA, Harvard, Vancouver, ISO, and other styles

9

Yakhyaeva, Gulnara. "Application of Boolean Valued and Fuzzy Model Theory for Knowledge Base Development." In 2019 International Multi-Conference on Engineering, Computer and Information Sciences (SIBIRCON). IEEE, 2019. http://dx.doi.org/10.1109/sibircon48586.2019.8958245.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Perhac, Jan, and Zuzana Bilanova. "Categorical Model of Functional Language with Natural Numbers and Boolean Values." In 2020 IEEE 15th International Conference on Computer Sciences and Information Technologies (CSIT). IEEE, 2020. http://dx.doi.org/10.1109/csit49958.2020.9322039.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!