You're using an ancient browser to surf the modern web. Please update to the latest version (and don't use Internet Explorer!).

Leonardi.DB
a logical geometry project

Diagrams (4533 to 4557 of 5551)

Searching for diagrams matching all criteria ...

Diagram Source Date
(min⁠–⁠max)
Aristotelian Family
B.C.
(min⁠–⁠max)
Geometric Shape
http://purl.org/lg/diagrams/demey_2018_computing-the-maximal-boolean_1dnckmej1_p-1325_1fbjjjnfu Computing the maximal Boolean complexity of families of Aristotelian diagrams, p. 1325, by Demey, Lorenz 2018 Jacoby-Sesmat-Blanché Sigma-3 3 Hexagon
http://purl.org/lg/diagrams/demey_2018_computing-the-maximal-boolean_1dnckmej1_p-1325_1fbjjpm14 Computing the maximal Boolean complexity of families of Aristotelian diagrams, p. 1325, by Demey, Lorenz 2018 Jacoby-Sesmat-Blanché Sigma-3 4 Hexagon
http://purl.org/lg/diagrams/demey_2018_computing-the-maximal-boolean_1dnckmej1_p-1325_1fbjjveib Computing the maximal Boolean complexity of families of Aristotelian diagrams, p. 1325, by Demey, Lorenz 2018 Classical Sigma-2 3 Rectangle
http://purl.org/lg/diagrams/demey_2018_computing-the-maximal-boolean_1dnckmej1_p-1330_1fbjrbltj Computing the maximal Boolean complexity of families of Aristotelian diagrams, p. 1330, by Demey, Lorenz 2018 Classical Sigma-2 3 Rectangle
http://purl.org/lg/diagrams/demey_2018_computing-the-maximal-boolean_1dnckmej1_p-1330_1fbjrnmlp Computing the maximal Boolean complexity of families of Aristotelian diagrams, p. 1330, by Demey, Lorenz 2018 Degenerate Sigma-2 with Unconnectedness 4 4 Rectangle
http://purl.org/lg/diagrams/demey_2018_computing-the-maximal-boolean_1dnckmej1_p-1330_1fbjrum93 Computing the maximal Boolean complexity of families of Aristotelian diagrams, p. 1330, by Demey, Lorenz 2018 Jacoby-Sesmat-Blanché Sigma-3 3–4 Hexagon
http://purl.org/lg/diagrams/demey_2018_computing-the-maximal-boolean_1dnckmej1_p-1334_1fbjsa65v Computing the maximal Boolean complexity of families of Aristotelian diagrams, p. 1334, by Demey, Lorenz 2018 Degenerate Sigma-2 with Unconnectedness 4 4 Rectangle
http://purl.org/lg/diagrams/demey_2018_computing-the-maximal-boolean_1dnckmej1_p-1334_1fbjslt50 Computing the maximal Boolean complexity of families of Aristotelian diagrams, p. 1334, by Demey, Lorenz 2018 Jacoby-Sesmat-Blanché Sigma-3 4 Hexagon
http://purl.org/lg/diagrams/demey_2018_computing-the-maximal-boolean_1dnckmej1_p-1334_1fbjss9ki Computing the maximal Boolean complexity of families of Aristotelian diagrams, p. 1334, by Demey, Lorenz 2018 Jacoby-Sesmat-Blanché Sigma-3 3 Hexagon
http://purl.org/lg/diagrams/demey-et-al-_2018_combinatorial-bitstring_1dnpb4avm_p-330_1fbm1fue2 Combinatorial Bitstring Semantics for Arbitrary Logical Fragments, p. 330, by Demey, Lorenz; Smessaert, Hans 2018 Classical Sigma-2 3 Rectangle
http://purl.org/lg/diagrams/demey-et-al-_2018_combinatorial-bitstring_1dnpb4avm_p-330_1fbm1kip0 Combinatorial Bitstring Semantics for Arbitrary Logical Fragments, p. 330, by Demey, Lorenz; Smessaert, Hans 2018 Classical Sigma-2 3 Rectangle
http://purl.org/lg/diagrams/demey-et-al-_2018_combinatorial-bitstring_1dnpb4avm_p-330_1fbm1vbdc Combinatorial Bitstring Semantics for Arbitrary Logical Fragments, p. 330, by Demey, Lorenz; Smessaert, Hans 2018 Classical Sigma-2 3 Rectangle
http://purl.org/lg/diagrams/demey-et-al-_2018_combinatorial-bitstring_1dnpb4avm_p-331_1fbm3ooss Combinatorial Bitstring Semantics for Arbitrary Logical Fragments, p. 331, by Demey, Lorenz; Smessaert, Hans 2018 Jacoby-Sesmat-Blanché Sigma-3 3 Hexagon
http://purl.org/lg/diagrams/demey-et-al-_2018_combinatorial-bitstring_1dnpb4avm_p-331_1fbm4fs93 Combinatorial Bitstring Semantics for Arbitrary Logical Fragments, p. 331, by Demey, Lorenz; Smessaert, Hans 2018 Sherwood-Czeżowski Sigma-3 4 Hexagon
http://purl.org/lg/diagrams/demey-et-al-_2018_combinatorial-bitstring_1dnpb4avm_p-331_1fbm4mj7o Combinatorial Bitstring Semantics for Arbitrary Logical Fragments, p. 331, by Demey, Lorenz; Smessaert, Hans 2018 Degenerate Sigma-3 with Unconnectedness 4 4 Hexagon
http://purl.org/lg/diagrams/demey-et-al-_2018_combinatorial-bitstring_1dnpb4avm_p-340_1fbmnsocl Combinatorial Bitstring Semantics for Arbitrary Logical Fragments, p. 340, by Demey, Lorenz; Smessaert, Hans 2018 Classical Sigma-2 3 Rectangle
http://purl.org/lg/diagrams/demey-et-al-_2018_combinatorial-bitstring_1dnpb4avm_p-340_1fbmoaj9d Combinatorial Bitstring Semantics for Arbitrary Logical Fragments, p. 340, by Demey, Lorenz; Smessaert, Hans 2018 Classical Sigma-2 3 Rectangle
http://purl.org/lg/diagrams/demey-et-al-_2018_combinatorial-bitstring_1dnpb4avm_p-346_1fbmoji4o Combinatorial Bitstring Semantics for Arbitrary Logical Fragments, p. 346, by Demey, Lorenz; Smessaert, Hans 2018 Classical Sigma-2 3 Rectangle
http://purl.org/lg/diagrams/demey-et-al-_2018_combinatorial-bitstring_1dnpb4avm_p-346_1fbmorfsi Combinatorial Bitstring Semantics for Arbitrary Logical Fragments, p. 346, by Demey, Lorenz; Smessaert, Hans 2018 Degenerate Sigma-2 with Unconnectedness 4 4 Rectangle
http://purl.org/lg/diagrams/demey-et-al-_2018_combinatorial-bitstring_1dnpb4avm_p-348_1fbmp67q2 Combinatorial Bitstring Semantics for Arbitrary Logical Fragments, p. 348, by Demey, Lorenz; Smessaert, Hans 2018 Classical Sigma-2 3 Rectangle
http://purl.org/lg/diagrams/demey-et-al-_2018_combinatorial-bitstring_1dnpb4avm_p-348_1fbmpdg7r Combinatorial Bitstring Semantics for Arbitrary Logical Fragments, p. 348, by Demey, Lorenz; Smessaert, Hans 2018 Degenerate Sigma-2 with Unconnectedness 4 4 Rectangle
http://purl.org/lg/diagrams/demey-et-al-_2018_combinatorial-bitstring_1dnpb4avm_p-351_1fbmpp489 Combinatorial Bitstring Semantics for Arbitrary Logical Fragments, p. 351, by Demey, Lorenz; Smessaert, Hans 2018 Jacoby-Sesmat-Blanché Sigma-3 3–4 Hexagon
http://purl.org/lg/diagrams/demey-et-al-_2018_combinatorial-bitstring_1dnpb4avm_p-351_1fbmqaiui Combinatorial Bitstring Semantics for Arbitrary Logical Fragments, p. 351, by Demey, Lorenz; Smessaert, Hans 2018 Jacoby-Sesmat-Blanché Sigma-3 3 Hexagon
http://purl.org/lg/diagrams/demey-et-al-_2018_combinatorial-bitstring_1dnpb4avm_p-351_1fbmqgh30 Combinatorial Bitstring Semantics for Arbitrary Logical Fragments, p. 351, by Demey, Lorenz; Smessaert, Hans 2018 Jacoby-Sesmat-Blanché Sigma-3 4 Hexagon
http://purl.org/lg/diagrams/demey-et-al-_2018_combinatorial-bitstring_1dnpb4avm_p-352_1fbn12689 Combinatorial Bitstring Semantics for Arbitrary Logical Fragments, p. 352, by Demey, Lorenz; Smessaert, Hans 2018 Jacoby-Sesmat-Blanché Sigma-3 3 Hexagon
↑ Back to top ↑